Max Sum Plus Plus HDU - 1024（DP+m子段最大和）

最新推荐文章于 2022-01-18 19:52:50 发布

原创最新推荐文章于 2022-01-18 19:52:50 发布 · 242 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

DP 专栏收录该内容

14 篇文章

订阅专栏

本文探讨了一种复杂版本的最大子序列和问题，给定一系列整数，需要找到特定数量的不重叠子序列，使得这些子序列的和达到最大值。文章通过一个具体的示例解释了问题，并提供了一个高效的解决方案，利用动态规划思想来实现。

Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more difficult problem.

Given a consecutive number sequence S 1, S 2, S 3, S 4 ... S x, ... Sn (1 ≤ x ≤ n ≤ 1,000,000, -32768 ≤ S x ≤ 32767). We define a function sum(i, j) = S i + ... + S j (1 ≤ i ≤ j ≤ n).

Now given an integer m (m > 0), your task is to find m pairs of i and j which make sum(i 1, j 1) + sum(i 2, j 2) + sum(i 3, j 3) + ... + sum(i m, j m) maximal (i x ≤ i y ≤ j x or i x ≤ j y ≤ j x is not allowed).

But I`m lazy, I don't want to write a special-judge module, so you don't have to output m pairs of i and j, just output the maximal summation of sum(i x, j x)(1 ≤ x ≤ m) instead. ^_^

Input

Each test case will begin with two integers m and n, followed by n integers S 1, S 2, S 3 ... S n.
Process to the end of file.

Output

Output the maximal summation described above in one line.

Sample Input

1 3 1 2 3
2 6 -1 4 -2 3 -2 3

Sample Output

6
8

#include<cstdio>
#include<cstring> 
#include<iostream>
#include<algorithm>

using namespace std;

const int INF = 0x3f3f3f3f;
const int maxn = 1e6 + 10;

int dp[maxn], w[maxn], a[maxn];

int read() {
	int f = 1, num = 0;
	int c = getchar();
	while (c < '0' || c > '9') {
		if (c == '-') f = -1;
		c = getchar();
	}
	while (c >= '0' && c <= '9') {
		num = (num << 3) + (num << 1) + c - 48;
		c = getchar();
	}
	return f*num;
}

int main(void) {
	
	int m, n;
	while (~scanf("%d %d", &m, &n)) {
		
		for (int i = 1; i <= n; ++i) {
			a[i] = read(), dp[i] = w[i] = 0;
		}
		//memset(dp, 0, sizeof(dp));  //慢了 
		//memset(w, 0, sizeof(w));
		int premax;
		for (int i = 1; i <= m; ++i) {
			premax = -INF;
			for (int j = i; j <= n; ++j) {
				
				dp[j] = max(dp[j-1], w[j-1]) + a[j];
				w[j-1] = premax;
				premax = premax > dp[j] ? premax : dp[j];
				
			}
			
		}
		printf("%d\n", premax);
	}
	
	return 0;
}

参考1

好参考