[algogeeks] Custom Software Development

iTechArt Group - Custom Software Development and Offshore outsourcing Company http://www.itechart.com/ Offshore custom software development company iTechArt - Web site and Content Management Solutions development, CMS consulting: Ektron, Drupal and DotNetNuke iTechArt Group provides high

[algogeeks] View this page Custom Software Development

Click on http://groups.google.com/group/algogeeks/web/custom-software-development - or copy paste it into your browser's address bar if that doesn't work. --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups

[algogeeks] How to find, efficiently, the maximum sum of atleast L consecutive integers from a sequence of N integers.

Hi all, How can we find the the maximum sum of atleast L consecutive integers given a sequence of N integers. The brute force approach of forming all possible length sequences at every index and finding their sum gives an O(N^2) solution which is not desirable. Can somebody tell me a better

[algogeeks] Re: How to find, efficiently, the maximum sum of atleast L consecutive integers from a sequence of N integers.

: Is it atleast L consecutive or L consecutive ??? On 3/20/06, vb [EMAIL PROTECTED] wrote: Hi all, How can we find the the maximum sum of atleast L consecutive integers given a sequence of N integers. The brute force approach of forming all possible length sequences at every

[algogeeks] Re: How to find, efficiently, the maximum sum of atleast L consecutive integers from a sequence of N integers.

Rajiv, What about the numbers greater than k distance(BTW, i wrote L, not k), you have to have atleast k and not necessarily k. [EMAIL PROTECTED] wrote: Just store the cummulative sums in one pass, second pass, keep two pointers at a distance k away, pass through the array once more and