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
思路:转移方程sum=sum>0?sum+=a[i]:a[i];
代码如下:
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int a[100010];
int main()
{
int t;
int k=0;
scanf("%d",&t);
while(t--)
{
int n,i,s,str,end,sum=0;
int max=-100000;
scanf("%d",&n);
s=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
if(sum>=0)
{
sum+=a[i];
}
else
{
sum=a[i];
s=i;
}
if(sum>max)
{
max=sum;
str=s;
end=i;
}
}
printf("Case %d:\n",++k);
printf("%d %d %d\n",max,str+1,end+1);
if(t>0)
printf("\n");
}
}