最大连续子序列
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 42355 Accepted Submission(s): 19193
Problem Description
给定K个整数的序列{ N1, N2, ..., NK },其任意连续子序列可表示为{ Ni, Ni+1, ...,
Nj },其中 1 <= i <= j <= K。最大连续子序列是所有连续子序列中元素和最大的一个,
例如给定序列{ -2, 11, -4, 13, -5, -2 },其最大连续子序列为{ 11, -4, 13 },最大和
为20。
在今年的数据结构考卷中,要求编写程序得到最大和,现在增加一个要求,即还需要输出该
子序列的第一个和最后一个元素。
Input
测试输入包含若干测试用例,每个测试用例占2行,第1行给出正整数K( < 10000 ),第2行给出K个整数,中间用空格分隔。当K为0时,输入结束,该用例不被处理。
Output
对每个测试用例,在1行里输出最大和、最大连续子序列的第一个和最后一个元
素,中间用空格分隔。如果最大连续子序列不唯一,则输出序号i和j最小的那个(如输入样例的第2、3组)。若所有K个元素都是负数,则定义其最大和为0,输出整个序列的首尾元素。
Sample Input
6
-2 11 -4 13 -5 -2
10
-10 1 2 3 4 -5 -23 3 7 -21
6
5 -8 3 2 5 0
1
10
3
-1 -5 -2
3
-1 0 -2
0
Sample Output
20 11 13
10 1 4
10 3 5
10 10 10
0 -1 -2
0 0 0
Hint
Hint Huge input, scanf is recommended.
特殊的DP思路:
/*
巧妙的DP写法
*/
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <queue>
#include <climits>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <vector>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
static const int MAX_N = 1e4 + 5;
int a[MAX_N];
int main() {
/*freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);*/
int k;
while (scanf("%d", &k) != EOF) {
if (k == 0) break;
for (int i = 0; i < k; ++i) scanf("%d", &a[i]);
int max_val = -INF, sum = 0, f_ele, e_ele, pre_ele = a[0];
for (int i = 0; i < k; ++i) {
int v = a[i];
if (sum >= 0) sum += v;
else {
sum = v;
pre_ele = v;
}
if (sum > max_val) {
f_ele = pre_ele;
e_ele = v;
max_val = sum;
}
}
if (max_val < 0) printf("0 %d %d\n", a[0], a[k - 1]);
else printf("%d %d %d\n", max_val, f_ele, e_ele);
}
return 0;
}
DP数组写法:
/*
DP数组写法
*/
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <queue>
#include <climits>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <vector>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
static const int MAX_N = 1e4 + 5;
int a[MAX_N], dp[MAX_N];
int main() {
/*freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);*/
int k;
while (scanf("%d", &k) != EOF) {
if (k == 0) break;
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= k; ++i) scanf("%d", &a[i]);
int f_ele, e_ele, max_val = -INF, cur_left, cur_right;
for (int i = 1; i <= k; ++i) {
dp[i] = max(dp[i - 1] + a[i], a[i]);
if (dp[i] == a[i]) {
cur_left = a[i];
cur_right = a[i];
}
else cur_right = a[i];
if (max_val < dp[i]) {
max_val = dp[i];
f_ele = cur_left;
e_ele = cur_right;
}
}
if (max_val < 0) printf("0 %d %d\n", a[1], a[k]);
else printf("%d %d %d\n", max_val, f_ele, e_ele);
}
return 0;
}