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 = 14
原创
2016-01-26 21:59:14 ·
284 阅读 ·
0 评论