seems to be a independent problem........u can see maximum subarray problem
On Tue, Nov 1, 2011 at 11:54 PM, atul007 <atul.87fri...@gmail.com> wrote: > Assume that there are n numbers (some possibly negative) on a circle, > and > we wish to find the maximum contiguous sum along an arc of the circle. > Give an > efficient algorithm for solving 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 > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
