动态规划 HDU - 1003 Max Sum（最大子段和）

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 4Case 2:7 1 6

思路：

构造b[j]（也就是下面代码中的b）表示以a[j]为结尾的最大字段和的值。

代码：

#include<iostream>
//Max Sum HDU - 1003 

using namespace std;

int main() {
	int T;
	cin >> T;
	int casenum = 0;
	while (T--) {
		int N;
		cin >> N;

		int *a = new int[N];
		int sum = 0; int b = 0;// int low = 0; 
		int high = 0;
		for (int i = 0; i < N; i++) {//cin >> a[i];
			cin >> a[i];
			if (i == 0) {
				sum = b = a[i];
			}else {
				if (b > 0) {
					b += a[i];
				}else {
					b = a[i];
					//low = i;
				}
				if (sum < b) {
					sum = b;
					high = i; //求出最大值和结束为止
				}
			}	
		}

		//输出开始位置
		int sum1 = sum;
		int low=high;
		for (int i = high; i >=0; i--) {
			sum1 = sum1 - a[i];
			if (!sum1) {
				low = i;
				//break;
			}
		}

		delete []a;
		if (!T) {
			cout << "Case " << ++casenum << ":\n" << sum << " " << low + 1 << " " << high + 1 << endl;
		} else {
			cout << "Case " << ++casenum << ":\n" << sum << " " << low + 1 << " " << high + 1 << endl << endl;
		}
		
	}

	return 0;
}