hdoj-Max Sum

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 + 4 = 14.

Input
The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).

Output
For each test case, you should output two lines. The first line is “Case #:”, # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.

Sample Input
2
5 6 -1 5 4 -7
7 0 6 -1 1 -6 7 -5

Sample Output
Case 1:
14 1 4

Case 2:
7 1 6

Author
Ignatius.L

知识点：动态规划(dp)

解题思路：这一题是要求连续的子序列和的值最大，打算把所有可能的子序列和的值都算出来，然后选出值最大的就是答案，先把第一个数字放进dp[0]作为第一个状态，然后最大值max变成dp[0]，此时记录子序列起点位置(每次max变化都要更新起点位置和终点位置)，然后判断加上后一个数字与max的大小，这样直到所有子序列都比完后max保存的就是最大值(即答案)。

总结：动态规划的题目重要的是状态转移方程，能把状态转移方程推导出来那么对题目的理解就会更深，更容易做出来。

---

书山有路勤为径，学海无涯苦作舟。–韩愈