4 ms·
Maximum subarray is a typical problem solved by a dynamic programming algorithm.
by chapium 7y ago
Maximum subarray is a typical problem solved by a dynamic programming algorithm.
- lacker 7y agoIt's possible to use dynamic programming but it's such a simple example you don't really have to. If you're familiar with dynamic programming at all, you should be able to get it - it would be pretty reasonable to assign this as a introductory homework program for the dynamic programming section of an algorithms class.