meke a corresponding cumulative sums array.. where S[i]= Summation(a[0] ... a[i])
Sum of subseq. [i..j]= S[j]-S[i-1] check all i,j pairs but this is O(n^2).. may be a better exists --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
