# HDU 1003 Max Sum(最大子序列和)

Max Sum
Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 65536/32768 K (Java/Others)

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

AC代码：

#include<stdio.h>

int main()
{
int T;
int n;
int temp;
int tmax;//保存最大值
int curbegin;//保存当前子序列开始的位置
int begint;//最大子序列开始位置
int endt;//最大子序列结束位置
int sum;//当前子序列的和
scanf("%d",&T);
for(int j = 1; j <= T; j++)
{
scanf("%d",&n);
//初始化
tmax = -1001;
curbegin = 1;
begint = endt = 1;
sum = 0;

for(int i = 1; i <= n; i++)
{
scanf("%d",&temp);
if(sum < 0)
{//从新的位置开始
sum = temp;
curbegin = i;
}
else
{
sum += temp;
}
if(tmax < sum)
{//状态及时更新
tmax = sum;
begint = curbegin;
endt = i;
}
}

printf("Case %d:\n",j);
printf("%d %d %d\n", tmax, begint, endt);
if(j != T)
printf("\n");
}
return 0;
}