Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 165114 Accepted Submission(s): 38679
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
Recommend
#include <iostream>
#define SIZE 100000
using namespace std;
int main()
{
int arr[SIZE]; //存放数组
long ori ; //前相加记录
long now ;
long max; //第i前n数
int from ; //标记
long to = 0,i,n,num;
int from_max,to_max;
cin>>num;
for(int j=0;j<num;j++)
{
cin>>n;
for(i=0;i<n;i++)
cin>>arr[i];
ori=arr[0];
now=arr[0];
max=arr[0];
from_max=from=1;
to_max=to=1;
for ( i=1; i<n; i++)
{ if (ori<0)
{ from = i+1;
to = i+1;
now = arr[i];
if(now>max)
{ max=now;
from_max=from;
to_max=to;
}
}
else
{
now = ori + arr[i];
if( max < now )
{ from_max=from;
to = i+1;
to_max=to;
max = now;
}
}
ori = now;
}
//打印结
cout<<"Case"<<" "<<j+1<<":"<<endl;
cout << max<<" "<<from_max <<" " << to_max << endl;
if(j<num-1) cout<<endl;
}
return 0;
}