ABC62 3N Numbers(单调队列优化DP)

3N Numbers

由题可知，要删除n个数，使得前n个数减后n个数的值最大，首先可以想到把所有3*n个数划分成3部分，第一部分就是前n个数，中间的就是待取的数，最后一部分就是后n个数，需要连续两次DP，分别从前往后和从后往前，dp1[i]表示的是从1到i里选n个数的最大值，dp2[i]表示的是从i到3*n内选n个数的最小值，那么答案就是dp1[i-1]-dp2[i]的最大值

AC代码：

#include <bits/stdc++.h>
using namespace std;
using LL = long long;
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    vector<LL> a(n * 3 + 1);
    priority_queue<LL, vector<LL>, greater<LL>> z1;
    priority_queue<LL, vector<LL>, less<LL>> z3;
    LL sum1 = 0, sum2 = 0;
    for (int i = 1; i <= 3 * n; i++) {
        cin >> a[i];
        if (i <= n) {
            z1.push(a[i]);
            sum1 += a[i];
        } else if (i >= 2 * n + 1) {
            z3.push(a[i]);
            sum2 += a[i];
        }
    }
    LL ans = sum1 - sum2;
    vector<LL> dp1(2 * n + 2), dp2(2 * n + 2);
    dp1[n] = sum1;
    dp2[2 * n + 1] = sum2;
    for (int i = n + 1; i <= 2 * n; i++) {
        if (a[i] > z1.top()) {
            sum1 -= z1.top();
            sum1 += a[i];
            z1.pop();
            z1.push(a[i]);
        }
        dp1[i] = sum1;
    }
    for (int i = 2 * n; i > n; i--) {
        if (a[i] < z3.top()) {
            sum2 -= z3.top();
            z3.pop();
            sum2 += a[i];
            z3.push(a[i]);
        }
        dp2[i] = sum2;
    }
    for (int i = n + 1; i <= 2 * n + 1; i++) {
        ans = max(ans, dp1[i - 1] - dp2[i]);
    }
    cout << ans << '\n';
    return 0;
}