[BZOJ4873][Shoi2017]寿司餐厅 网络流

选择区间[l,r]，那么必须选择区间[l,r-1]和[l+1,r]
很容易可得一个最大权闭合子图的模型

对于选取一个单点，花费的式子的形式是$mx^2+cx$
对每个单点开一个节点$p$，对每个颜色开一个节点$q$
对于单点编号为$t$颜色为$x$
每个$p$连接到$T$花费为$x$，每个$q$连接到T花费为$mx^2$
选择单点，就必须选择对应的p和q

跑一遍最小割即可
需要当前弧优化

#include <bits/stdc++.h>
#define INF (1<<29)
#define N 20050
#define M 40*N
using namespace std;

int n,m;
int cur[N],h[N],p[N],cnt=1,tot,L[N],R[N],F[105][105],S,T;
int a[N],d[105][105],ans,tp;

inline int rd() {int r;scanf("%d",&r);return r;}
struct Edge{int b,v,n;}e[M];
void add_Edge(int a,int b,int v) { e[++cnt] = (Edge){b,v,h[a]}, h[a] = cnt; }
void add(int a,int b,int v) {add_Edge(a,b,v),add_Edge(b,a,0);}

bool BFS() {
    bool flag = 0;
    for (int i=1;i<=tot;i++) p[i] = 0;
    for (int i=1;i<=tot;i++) cur[i] = h[i];
    queue<int> q;
    p[S] = 1;
    q.push(S);
    while (!q.empty()) {
        int u = q.front(); q.pop();
        if (u == T) flag = 1;
        for (int i=h[u];i;i=e[i].n) {
            int v = e[i].b, cp = e[i].v;
            if (!p[v] && cp > 0)
                p[v] = p[u] + 1, q.push(v);
        }
    }
    return flag;
}

int DFS(int u,int flow) {
    if (u == T) return flow;
    int f = flow, g = 0;
    for (int i=cur[u];i;i=e[i].n) {
        cur[u] = i;
        int v = e[i].b, cp = e[i].v, tmp = 0;
        if (p[v] == p[u]+1 && cp>0 && (tmp=DFS(v,min(f,cp))) >0) {
            e[i].v -= tmp;
            e[i^1].v += tmp;
            f -= tmp;
            g += tmp;
        }
    }
    return g;
}

int main() {
    n = rd(), m = rd();
    for (int i=1;i<=n;i++) a[i] = rd(), tp = max(a[i], tp);
    for (int i=1;i<=n;i++)
        for (int j=i;j<=n;j++) d[i][j] = rd();

    S = ++tot, T = ++tot;
    for (int i=1;i<=n;i++)
        for (int j=i;j<=n;j++) {
            F[i][j] = ++tot;
            d[i][j] > 0 ? ans += d[i][j], add(S, F[i][j], d[i][j]) : add(F[i][j], T, -d[i][j]);
        }
    for (int i=1;i<=tp;i++) L[i] = ++tot, add(L[i], T, m*i*i);
    for (int i=1;i<=n;i++) R[i] = ++tot, add(R[i], T, a[i]);

    for (int i=1;i<=n;i++)
        for (int j=i;j<=n;j++) {
            if (i==j) {
                add(F[i][i], L[a[i]], INF);
                add(F[i][i], R[i], INF);
            } else {
                add(F[i][j], F[i][j-1], INF);
                add(F[i][j], F[i+1][j], INF);
            }
        }

    while (BFS())
        ans -= DFS(S, INF);
    cout << ans << endl;
    return 0;
}