Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 195854 Accepted Submission(s): 45718
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,x[100005];
// freopen("shuju.txt","r",stdin);
scanf("%d",&t);
for(int k=0;k<t;++k)
{
if(k)
{
printf("\n");
}
scanf("%d",&n);
for(int i=0;i<n;++i)
{
scanf("%d",&x[i]);
}
int ans=x[0],tp=0,l=0,r=0,m=0;
for(int i=0;i<n;++i)
{
if(tp<0)
{
tp=0;m=i;
}
tp+=x[i];
if(tp>ans)
{
ans=tp;l=m;r=i;
}
}
printf("Case %d:\n%d %d %d\n",k+1,ans,l+1,r+1);
}
return 0;
}