Jump to content

Dynamic Programming

mathmari

By mathmari
in Computer Science

 Share

Recommended Posts

mathmari

mathmari

Posted
Posted

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}.
I hope someone can help me...
Thanks in advance!!!

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
 Share
Go to topic listing
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.