Given a sequence of K integers { N1, N2, …, NK }. A continuous subsequence is defined to be { Ni, Ni+1, …, Nj } 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
思路:
动态规划,mlen数组存储最大子序列和,mlen[i]表示以下标i为结尾的序列的最大子序列和。
整个序列的最大子列和则是在所有mlen[i] for i =1:k 中找最大值,并且把该下标i记录到max_index,即子列的末尾下标。子列的开头下标存储在数组中,亦用动态规划填充。
有关于动态规划的理解可以参考我之前的一篇博客:
以纯小白的角度看 动态规划(DP学习总结)
源码:
#include<bits/stdc++.h>
#define Max 10010
using namespace std;
int s[Max];//序列
int mlen[Max];//mlen[i]表示以s[i]结尾的最大子列和
int ans = -1;//整个序列的最大子列和
int max_index = 0;//最大子列的末尾下标max_index
int pre[Max];//max_index的前驱下标
int main() {
int k;
cin >> k;
int f = 1;
for (int i = 1; i <= k; i++) {//若序列全部为负数,则输出0
cin >> s[i];
if (s[i] >= 0)
f = 0;
}
mlen[0] = 0;
for (int i = 1; i <= k; i++) {
if (s[i] >= mlen[i - 1] + s[i]) {
mlen[i] = s[i];
pre[i] = i;
} else {
mlen[i] = mlen[i - 1] + s[i];
pre[i] = pre[i - 1];
}
if (mlen[i] > ans) {
ans = mlen[i];//更新最大子列和
max_index = i;//更新最大子列末尾下标
}
}
if (f)
cout << 0 << " " << s[1] << " " << s[k] << endl;
else
cout << ans << " " << s[pre[max_index]] << " " << s[max_index] << endl;
}