Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 270828 Accepted Submission(s): 64383
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
Author
Ignatius.L
题目不难,就是求这组数中的连续数的和的最大值,不是什么子序列,其次就是格式问题,需要特别注意!
代码:
#include<queue>
#include<math.h>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;
int main()
{
int test,q=1,m;
scanf("%d",&test);
m=test;
while(test--)
{--m;
int i,j,n,s=1,start=1,end=1,sum=0,sum1=-1001,a[101011];
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(i=1;i<=n;i++)
{
sum+=a[i];
if(sum>sum1)
{
sum1=sum;
start=s;
end=i;
}
if(sum<0)
{
sum=0;
s=i+1;
}
}
printf("Case %d:\n%d %d %d\n",q++,sum1,start,end);
if(m>0)
printf("\n");
}
return 0;
}