How do you get 0.03 s? Less than O(N^4)

Can you solve this problem in less time than O(N^4) ?

please email to scythe@toughguy.net

thank you

do you know...

an O(N) algorithm to solve this task : find the consecutive

subsequence with the largest sum of a given sequence of N integers ?

thank you xyz! your hint really inspires me

> an O(N) algorithm to solve this task : find the consecutive

> subsequence with the largest sum of a given sequence of N integers ?

Re: How do you get 0.03 s? Less than O(N^4)

you precalculate sums in the matrix for O(n^3) and uses a DP

to reach O(n^2). I'll send my source later.