Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 124729 Accepted Submission(s): 28809
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 t,n,u,temp,now,max,pos1,pos2,x,i;
scanf("%d",&t);
for(u=1; u<=t; u++)
{
scanf("%d%d",&n,&temp);
now=max=temp;
pos1=pos2=x=1;
for(i=2; i<=n; i++)
{
scanf("%d",&temp);
if(now+temp<temp)
{
now=temp;
x=i;
}//丢掉前面的数
else
{
now+=temp;
}
if(now>max)
{
max=now;
pos1=x;
pos2=i;
}//该阶段的最大值与历史最大值做比较
}
printf("Case %d:\n",u);
printf("%d %d %d\n",max,pos1,pos2);
if(u!=t) printf("\n");
}
return 0;
}