Jump to content

Dynamic Programming

mathmari
in Computer Science

Featured Replies

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

Archived

This topic is now archived and is closed to further replies.

Go to topic listing

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.

Configure browser push notifications
Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.