Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 46712 Accepted Submission(s): 10263
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
【解法】这题一看就是DP的,但是一直没有想到如何推出最优子结构,后来发现我陷入了最长公共子序列的思路里面没出来动态规划f[i]=max{f[j]+f[j+1]+...+f[i]} 以f[i]结尾的连续最大和 //思路就陷在这里
所求为max{f[1],...,f[n]}=sum
状态转移:
if f[i-1]>0 f[i]=f[i-1]+a[i]
else f[i]=a[i]
if f[i]>sum sum=f[i]
完了sum就是最大和
在中间记录起点 终点就可