动态规划01-HDU-1003
Problem Description
Given 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 +...
原创
2019-02-03 09:10:24 ·
106 阅读 ·
0 评论