Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 146250 Accepted Submission(s): 34156
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 <iostream>
#include <stdio.h>
using namespace std;
int a[100010];
int MaxSum(int a[],int n,int &start,int &end)
{
int ThisSum=0,k=0;
int MaxSum=-100000;
for (int i=0; i<n; i++)
{
ThisSum+=a[i];
if(ThisSum>MaxSum)
{
MaxSum=ThisSum;
start=k;
end=i;
}
if(ThisSum<0)
{
ThisSum=0;
k=i+1;
}
}
return MaxSum;
}
int main()
{
int t,n,ans,Case=0,start,end;
cin>>t;
while (t--)
{
cin>>n;
start=end=0;
for (int i=0; i<n; i++)
{
cin>>a[i];
}
ans=MaxSum(a,n,start,end);
cout<<"Case "<<++Case<<":"<<endl;
cout<<ans<<" "<<start+1<<" "<<end+1<<endl;
if(t)
{
cout<<endl;
}
}
return 0;
}