You have used non-standard terms. By "arrangement" do you mean a sequence? By a "range" do you mean a "contiguous subsequence?" If so, then there are O(k|S|) partitions.
If on the other hand "arrangement" means "set" and "range" means "subset," then indeed the problem is NP complete. --~--~---------~--~----~------------~-------~--~----~ 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-beta.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
