Let M(j) be the maximum sum of terms of a consecutive subsequence, which last term is aj. Prove that M(j)=max{M(j-1)+aj, aj}.
Thanks in advance!!!
CodeGuru Home | VC++ / MFC / C++ | .NET / C# | Visual Basic | VB Forums | Developer.com |
Results 1 to 2 of 2
Thread: Dynamic Programming!!!!
|
Click Here to Expand Forum to Full Width |