HDU1003 Max Sum

问题描述：找出最长连续子序列和

2
5 6 -1 5 4 -7
7 0 6 -1 1 -6 7 -5

Case 1:
14 1 4

Case 2:
7 1 6

#include <iostream>
using namespace std;

int main()
{
	freopen("C:\\in.txt","r",stdin);
	int T;
	int k=0;
	scanf("%d",&T);
	while(T--){
		int N;
		scanf("%d",&N);
		int max=-0x7fffffff,start,end,temp=1,sum=0;
		int num;
		for(int i=0;i<N;i++){
			scanf("%d",&num);
			sum+=num;
			if(sum>max){
				max=sum;
				start=temp;
				end=i+1;
			}
			if(sum<0){
				sum=0;
				temp=i+2;
			}
		}
		printf("Case %d:\n%d %d %d\n",++k,max,start,end);
		if(T!=0)printf("\n");
	}
	return 0;
}

HDU1003 Max Sum

原文：http://blog.csdn.net/starcuan/article/details/18893381