1007 Maximum Subsequence Sum (25分) [DP]

 

Given a sequence of K integers { N​1​​, N​2​​, ..., N​K​​ }. A continuous subsequence is defined to be { N​i​​, N​i+1​​, ..., N​j​​ } where 1≤i≤j≤K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given sequence { -2, 11, -4, 13, -5, -2 }, its maximum subsequence is { 11, -4, 13 } with the largest sum being 20.

Now you are supposed to find the largest sum, together with the first and the last numbers of the maximum subsequence.

Input Specification:

Each input file contains one test case. Each case occupies two lines. The first line contains a positive integer K (≤10000). The second line contains K numbers, separated by a space.

Output Specification:

For each test case, output in one line the largest sum, together with the first and the last numbers of the maximum subsequence. The numbers must be separated by one space, but there must be no extra space at the end of a line. In case that the maximum subsequence is not unique, output the one with the smallest indices i and j (as shown by the sample case). If all the K numbers are negative, then its maximum sum is defined to be 0, and you are supposed to output the first and the last numbers of the whole sequence.

Sample Input:

10
-10 1 2 3 4 -5 -23 3 7 -21

Sample Output:

10 1 4

作者

CHEN, Yue

单位

浙江大学

代码长度限制

16 KB

时间限制

200 ms

内存限制

64 MB

 

题解:

#include <iostream>

using namespace std;

const int N = 10010;

int num[N];

int main() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++)
		cin >> num[i];

	int res = -1, l, r;
	for (int i = 1, f = -1, start; i <= n; i++)
	{
		if (f < 0) f = 0, start = i;
		f += num[i];
		if (res < f)
		{
			res = f;
			l = num[start], r = num[i];
		}
	}

	if (res < 0) res = 0, l = num[1], r = num[n];
	cout << res << ' ' << l << ' ' << r << endl;
	return 0;
}

 

展开阅读全文

没有更多推荐了,返回首页

©️2019 CSDN 皮肤主题: 大白 设计师: CSDN官方博客
应支付0元
点击重新获取
扫码支付

支付成功即可阅读