HOJ1003

Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 42374 Accepted Submission(s): 9271


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，然后自己学写了一下，以后就在这javaeye发些AC了的源码作为学习笔记吧
#include<iostream>
using namespace std;

void main() {
int n,m;
int i,j,temp;
int start,start2, end;
int sum,max;
cin>>n;
for(i=1; i<=n; i++) {
cin>>m>>temp;
start2 = 1;
start = 1;
end = 1;
sum = temp;
max = temp;
for(j=2; j<=m; j++) {
cin>>temp;
if(max + temp < temp) { //因为不确定max与sum的大小所以先用start2来保存位置
max = temp;
start2 = j;

} else
max += temp;
if(sum < max) {
sum = max;
start = start2;
end = j;
}
}
cout<<"Case "<<i<<":"<<endl;
cout<<sum<<" "<<start<<" "<<end<<endl;
if(i != n)
cout<<endl;

}

}