【HDU】1003 Max Sum(动态规划、子序列最大和)
Problem DescriptionGiven 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...
原创
2018-04-10 19:24:19 ·
317 阅读 ·
0 评论