随笔分类 -  【动态规划】-> 最大和

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)... 阅读全文

posted @ 2015-04-16 16:38 LLGemini 阅读(119) 评论(0) 推荐(0)