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
代码:
#include <stdio.h>
int main()
{
int n,T,a,start,end,max,k,i,p,t;
scanf("%d",&T);
for(p=1;p<=T;p++)
{
scanf("%d",&n);
max=-1001;
t=0;
start=1;
end=1;
k=1;
for(i=1;i<=n;i++)
{
scanf("%d",&a);
t+=a;
if(t>max)
{
max=t;
start=k;
end=i;
}
if(t<0)
{
t=0;
k=i+1;
}
}
if(p!=1)
printf("\n");
printf("Case %d:\n",p);
printf("%d %d %d\n",max,start,end);
}
}
思路:
背包,这道题需要记录最大值,开始,结束,也就是求区段最大值。随时更新最大值和初始值,结束值!