HDU 1003 MAXSUM（最大子序列和）
摘要：
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-08-14 15:19 无谓的味道 阅读(150) 评论(0) 推荐(0) 编辑