问题描述:
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
题目大意:
求数组的最大连续和,输出最小的能构成最大连续和的子数组的首位置和末位置。
思路:
动态规划,dp[i]表示以第i个元素作为尾元素的最大连续和,有递推公式如下:dp[i] = max(dp[i-1], 0) + a[i]; 注意所有元素都为零的情况。
代码如下:
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 10005;
int a[maxn];
int dp[maxn]; // dp[i]:以第i个元素结尾的最大连续和
int main()
{
int n;
cin >> n;
for(int i = 0; i < n; i ++) {
cin >> a[i];
}
dp[0] = a[0];
int begin = 0, end = 0;
for(int i = 1; i < n; i ++) {
dp[i] = max(0, dp[i - 1]) + a[i];
}
int m = dp[0];
for(int i = 1; i < n; i ++) {
if(dp[i] > m) {
m = dp[i];
end = i;
}
}
int sum = 0;
for(int i = end; i >= 0; i --) {
sum += a[i];
if(sum == m)
begin = i;
}
if(m < 0) {
m = 0;
begin = 0;
end = n - 1;
}
cout << m << " " << a[begin] << " " << a[end] << endl;
return 0;
}