HDU 1003 Max Sum

 

 

Max Sum

 

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

 

 

 

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 <stdio.h>
int main() {
	int T, N, num, max, sum, s, e, k;
	int kase = 1;
	scanf("%d", &T);    // T：组数
	while(T--) {
		scanf("%d", &N);    // N：元素个数
		for(int i=1; i<=N; i++) {
			scanf("%d", &num);      // num：当前输入元素
			if(i == 1) {
				max = sum = num;    // max:全局最大和；sum：局部最大和；
				k = s = e = 1;      // k:局部最大和开头；s:全局最大和对应开头；e：全局最大和对应结尾
			}
			else {
				sum += num;
				if(num > sum) {	sum = num; k = i; }     // i个数前的和为负数，则当前值为局部最大和
				if(sum > max) {	max = sum; s = k; e = i; }
			}
		}
		printf("Case %d:\n%d %d %d\n", kase++, max, s, e);
		if(T) printf("\n");
	}
	return 0;
}

 

感受：起初用了两个循环+数组来做，但是超时了；之后找度娘后，发现关键是知道什么时候和为负数，此时便可重新记和；

 

http://acm.hdu.edu.cn/showproblem.php?pid=1003