On 3/20/06, vb <[EMAIL PROTECTED]> wrote: > How can we find the the maximum sum of atleast L consecutive integers > given a sequence of N integers. if I understood correctly the problem, just sort the array and take the first L integers. This requires O(log(n)+L).
bye ! Mattia Merzi. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
