求最大子序列和 及其 子序列的左端点和右端点 A - Max Sum

Time limit

1000 ms

Memory limit

32768 kB

OS

Windows

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 <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
const int maxn = 1e5+100;
int main()
{
	int t;
	cin >> t;
	int k;
	int a[maxn];
	int cnt = 1;
	int flag = 0;
	while(t--)
	{
		if(flag) cout << endl;
		else flag = 1;
      cin >> k;
      for(int i = 0;i < k;i++)
      	cin >> a[i];
      int sum = a[0],mmax = a[0];
      int l = 0,r = 0;
      int x = 0;

      for(int i = 1;i < k;i++)
      {
      	if(sum+a[i] < a[i])
      	{
      		sum = a[i];
      		x = i;
      	}
      	else 
      	{
      		sum+=a[i];
      	}
      	if(sum > mmax)
      	{
      		mmax = sum;
      		l = x;
      		r = i;
      	}
      }
      
      printf("Case %d:\n",cnt++);
      printf("%d %d %d\n",mmax,l+1,r+1);
	}
	return 0;
}