Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 118732 Accepted Submission(s): 27508
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
#define NIF -99999999
#include
using namespace std;
int main()
{
int T,n,i,j,start,end,sum,max,flag;
while(cin>>T)
{
for(j=1;j<=T;j++)
{
max=NIF ;
sum=0;
flag=start=end=1;
cin>>n;
vectorarr(n+5,0); //vectorarr(n,0)的意思就是 创建了一个 int 类型的空的vector容器数组,和一个 int 类型n+5个元素,且值均为0的vecotr容器数组arr。
for(i=1;i<=n;i++)
{
cin>>arr[i] ;
sum+=arr[i] ;
if(sum>max)
{
max=sum;
start=flag ;
end=i;
}
if(sum<0)
{
flag=i+1;
sum=0;
}
}
cout<<"Case "<<j<<":"<<endl;
cout<<max<<" "<<start<<" "<<end<<endl;
if(j<<endl;
}
}
return 0;
}