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
题解:从第一个开始不断累加,如果累加和小于0,则从下一个开始累加。期间要记录下开始累加的下标,以及更新最大的累加和。
#include<iostream>
using namespace std;
int a[100010];
int main()
{
int first, start, end, T, N, sum, maxsum;
cin >> T;
for (int i = 1; i <= T; i++)
{
cin >> N;
for (int j = 1; j <= N; j++)
cin >> a[j];
first = start = 1;
end = 1;
sum = maxsum = a[1];
for (int j = 2; j <= N; j++)
{
if (sum >= 0)
sum = sum + a[j];
else
{
first = j;
sum = a[j];
}
if (maxsum <= sum)
{
start = first; end = j;
maxsum = sum;
}
}
cout << "Case " << i << ":" << endl;
cout << maxsum << " " << start << " " << end << endl;
if (i < T)
cout << endl;
}
return 0;
}