our requirement is - is to minimize the maximum number of pages assigned to a single scriber
Right? see the example input and output 100 200 300 400 500 600 700 800 900 if is divided as 100 200 300 400 500 / 600 700 / 800 900 which has 1500 / 1300 / 1700 each scriber gets, so maximum is - 1700 if we divide it as 100 600 700 / 200 500 800 / 300 400 900 which has 1400 / 1500 / 1600 each scriber gets, so maximum is only - 1600 Is there any flaw in the question? or am I missing anything? I think this question is similar to we have n elements, divide into m sets such that their differnce is minimum. Then is it NP - complete 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-beta.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
