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>
using namespace std;
#define MAX 100001
int a[MAX];
int MaxSum(int n,int &start,int &end)
{
int max=0,sum=0;
int stemp=1; start=1;
for (int i=1;i<=n;i++)
{
sum+=a[i];
if(sum<0){
sum=0;
stemp=i+1;
}
if (sum>max)
{
max=sum;
end=i;
start=stemp;
}
}
if (max==0)
{
max=a[1]; start=end=1;
for (int i=2;i<=n;i++)
{
if (max<a[i])
{
max=a[i];
start=i;end=i;
}
}
}
return max;
}
int main()
{
int t,n,k=1; cin>>t;
while (t--)
{
cin>>n;
for (int i=1;i<=n;i++)
cin>>a[i];
int start=1,end=1;
int m=MaxSum(n,start,end);
cout<<"Case "<<k++<<":"<<endl;
cout<<m<<" "<<start<<" "<<end<<endl;
if (t) cout<<endl;
}
return 0;
}