MaxSubseqSum
1.0.0
Description:
Given (possibly negative) integer sequences A1, A2, A3..., An, find the maximum value of the sum of sub-sequences in this sequence. (If all integers are negative, the maximum subsequence sum is 0). For example: input integer sequence:-2, 11, 8, -4, -1, 16, 5, 0, then the output answer is 35, that is, the sum from A2 to A6.
