ACM学习历程—HDU1003 Max Sum(dp && 最大子序列和)
摘要:
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 ma... 阅读全文
posted @ 2015-05-12 18:07 AndyQsmart 阅读(193) 评论(0) 推荐(0)
浙公网安备 33010602011771号