From charlesreid1

No edit summary
No edit summary
Line 1: Line 1:
MVCS: Maximum value continuous subsueqnce
==Problem Description==
==Problem Description==



Revision as of 21:34, 9 August 2017

MVCS: Maximum value continuous subsueqnce

Problem Description

Given a sequence of integers, $ a_1, a_2, \dots, a_n $, determine the subsequence of integers with the maximum sum.

(Note, this problem is only interesting if there are negative numbers.)

Solution

This is a fairly straightforward dynamic programming problem that just requires evaluating the maximum sum for a sliding window, and store the results in a 1D array.

https://charlesreid1.com:3000/cs/java/src/master/dynamic-programming/max-val-seq

Flags