[algogeeks] Re: a problem

Fri, 16 Jun 2006 21:50:03 -0700

I think that Greedy algorithm can resolve this problem and get the optimal solution.

On 6/17/06, Thomas.Chang <[EMAIL PROTECTED]> wrote:

suppose a number sequence, for example:
4, 1, 5, 9, 2, 3
the task is to devide it into as less groups as possible so that in
each group the numbers are sorted incrementally without changing the
original order.
for example, the above sequence can be devided into:
4, 5, 9,
1, 2, 3
2 groups in all.

How to solve this problem?



--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---

Reply via email to