<span style="font-family: Arial, Helvetica, sans-serif;"></span><pre name="code" class="cpp"><span style="font-family: Arial, Helvetica, sans-serif;">1007. Maximum Subsequence Sum (25)
Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1 <= i <= j <= K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given sequence { -2, 11,......
阅读全文