hdu-1003 Max Sum

Max Sum

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

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<iostream>
#include<cstring>
using namespace std;
const int N = 100001;
int dp[N];

int main()
{
	int T,C=1;
	freopen("data.txt","r",stdin);
	scanf("%d",&T);
	while(T--){
		int n;
		scanf("%d",&n);
		memset(dp,0,sizeof(dp));
		for(int i=1;i<=n;i++) scanf("%d",&dp[i]);
		
		int Max=dp[1];
		int l=1,r=1,temp=1;
		for(int i=2;i<=n;i++){
			if(dp[i-1]>=0){
				dp[i]=dp[i]+dp[i-1];
			}else{
				temp=i;
			}
			if(dp[i]>Max){
				Max=dp[i];
				l=temp;
				r=i;
			}
		}
		if(C>1) printf("\n");
		printf("Case %d:\n",C);
		printf("%d %d %d\n",Max,l,r);
		
		C++;
	}
	return 0;
}