HDOJ 1003 MaxSum (求出对应区间)

Max Sum

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 301482    Accepted Submission(s): 71546

 

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<bits/stdc++.h>
#define rep(i,j,k) for(int i = j; i < k; ++i)
#define mst(a,b) memset((a),(b),sizeof(a))
#define INF  0x3f3f3f3f
using namespace std;
typedef long long LL;

const int N = 1e5+5;
inline LL read(){
	int f = 1; LL ans = 0; char c = getchar();
	while(!isdigit(c)){if(c =='-') f = -1; c= getchar();}
	while(isdigit(c)){ans = ans*10 + c-'0'; c = getchar();}
	return f*ans;
}
int a[N];
int main()
	{
		int t = read(),n;
		int kcase = 0;
		int st,en;
		while(t--){
			st = en = 1;
			n = read();
			mst(a,0);
			rep(i,1,n+1) a[i] = read();
			LL mmax = -INF;	
			LL curSum = 0;
			int len = 0;// 标记当前最大字段和长度
			rep(i,1,n+1){
				if(curSum < 0){
					curSum = a[i];
					len = 1;// 重新开始时候记为1
				}
				else{
					curSum += a[i];
					++len; // 连续可加 这长度增加
				}
				if(curSum > mmax){// 这样就可以保证 记录的一定是相同结果中的第一个区间
						mmax = curSum;
						en = i;
						st = en-len+1; //记录当前最大字段对应起点
					}
			}
			printf("Case %d:\n",++kcase);
			printf("%d %d %d\n",mmax,st,en);
			if(t != 0){
				printf("\n");
			}
		}		 
	
	 	return 0;
 	}