阅读背景:

第一周01-复杂度2MaximumSubsequenceSum

来源:互联网 

Given a sequence of K integers { N​1​​, N​2​​, ..., N​K​​ }. A continuous subsequence is defined to be { N​i​​, N​i+1​​, ..., N​j​​ } 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, -4, 13, -5, -2 }, its maximum subsequence is { 11, -4, 13 } with the largest sum being 20. Given a sequence of K integers { N​1​​, N​2​​, ...




你的当前访问异常,请进行认证后继续阅读剩余内容。

分享到: