Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 273386 Accepted Submission(s): 64911
Total Submission(s): 273386 Accepted Submission(s): 64911
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
25 6 -1 5 4 -77 0 6 -1 1 -6 7 -5
Sample Output
Case 1:14 1 4Case 2:7 1 6
Author
Ignatius.L
#include <cstdio>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t,a[100005],pre,pr,qre,ma,n,x,k;
cin>>t;
for(k=1; k<=t; k++)
{
cin>>n;
ma=-1111;
x=0;
for(int i=1; i<=n; i++)
scanf("%d",&a[i]);
pre=1;
for(int i=1; i<=n; i++)
{
if(x>=0)
{
x+=a[i];
}
else
{
x=a[i];
pre=i;
}
if(ma<x)
{
ma=x;
pr=pre;
qre=i;
}
}
printf("Case %d:\n%d %d %d\n",k,ma,pr,qre);
if(k!=t)
printf("\n");
}
}