阅读背景:

HDU 1003 Max Sum(动态规划)_Tony5t4rk的博客

来源:互联网 

Description:

Given a sequence a[1],a[2],a[3]…a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.Given a sequence a[1],a[2




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

分享到: