经典动态规划问题——最大子段和问题
hud1003
问题描述
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 + 4 = 1
原创
2017-07-10 12:10:46 ·
912 阅读 ·
0 评论