CodeGuru Home VC++ / MFC / C++ .NET / C# Visual Basic VB Forums Developer.com
Results 1 to 2 of 2
  1. #1
    Join Date
    Apr 2013

    Dynamic Programming!!!!

    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!!!

  2. #2
    Join Date
    Jan 2006

    Re: Dynamic Programming!!!!

    What attempt have you made to do your own homework?
    C + C++ Compiler: MinGW port of GCC
    Build + Version Control System: SCons + Bazaar

    Look up a C/C++ Reference and learn How To Ask Questions The Smart Way
    Kindly rate my posts if you found them useful

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts

Windows Mobile Development Center

Click Here to Expand Forum to Full Width

On-Demand Webinars (sponsored)

We have made updates to our Privacy Policy to reflect the implementation of the General Data Protection Regulation.