51nod 1053 最大M子段和 V2
ygc问的一道题..
一个经典dp题目,但 n,m≤50000 。
需要猜一个结论:最大
M
子段和,必然由最大
证明不会….
然后就可以用链表+堆做了。
但一个奇怪的发现是:这个算法的后半部分等价于将所有正数取负,把相邻的负数缩成一个,然后在序列中选取m个不相邻元素的最大值…这两个问题莫不是什么对偶之类的…
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 50005;
int n, m;
long long a[MAXN];
long long sum[MAXN];
long long tab[MAXN*4];
int top = 0;
int l[MAXN*4], r[MAXN*4];
int killed[MAXN*4];
priority_queue<pair<long long, int> > que;
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%lld", &a[i]), sum[i] = sum[i-1]+a[i];
int last = 0, cnt = 0;
long long ans = 0;
for (int i = 1; i <= n; i++)
if (a[i] >= 0) {
cnt++;
if (last != 0) tab[++top] = sum[i-1]-sum[last];
ans += a[i];
tab[++top] = -a[i];
last = i;
}
if (cnt <= m) {
cout << ans << endl;
return 0;
}
for (int i = 1; i <= top; i++)
l[i] = i-1, r[i] = i+1;
r[top] = 0;
for (int i = 1; i <= top; i++) que.push(make_pair(tab[i], i));
for (int i = cnt; i > m; i--) {
while (killed[que.top().second]) que.pop();
pair<long long, int> pr = que.top(); que.pop();
ans += pr.first;
int id = pr.second;
killed[id] = 1;
if (!l[id] || !r[id]) {
if (!l[id]) killed[r[id]] = 1, l[r[r[id]]] = 0;
else killed[l[id]] = 1, r[l[l[id]]] = 0;
} else {
int L = l[id], R = r[id];
tab[++top] = tab[L]+tab[R]-tab[id];
killed[L] = killed[R] = 1;
r[l[L]] = l[r[R]] = top, l[top] = l[L], r[top] = r[R];
que.push(make_pair(tab[top], top));
}
}
cout << ans << endl;
return 0;
}