Codeforces ~ 1082G ~ Petya and Graph （最大权闭合子图）

题意

N个点M条边，每个点有一个点权，每条边有一个边权。要求选出一个子图，使得边权和-点权和最大。
选这条边就必须选这条边的两个端点。

思路

其实就是边为正权值的点，点就是负权值的点，这样就是最大权闭合图的问题了。
源点s为0，汇点t为n+m+1，边成为的点编号为[1,m]，原来的点编号为[m+1,m+n]。建图如下：
①s向[1,m]建边，容量为该边的边权
②[m+1,m+n]向汇点建边，容量为点权
③根据每条边建图，边点向两个端点建边，容量为INF
注意开long long即可

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 2e3 + 5;
typedef long long LL;
const LL INF = 0x3f3f3f3f3f3f3f3f;
struct Edge
{
    int from, to; LL cap, flow;       //起点,终点,容量,流量
    Edge(int u, int v, LL c, LL f) : from(u), to(v), cap(c), flow(f) {}
};
struct Dinic
{
    int n, m, s, t;                //结点数,边数(包括反向弧),源点s,汇点t
    vector<Edge> edges;            //边表。edges[e]和edges[e^1]互为反向弧
    vector<int> G[MAXN];           //邻接表，G[i][j]表示结点i的第j条边在edges数组中的序号
    int d[MAXN];                   //从起点到i的距离（层数差）
    int cur[MAXN];                 //当前弧下标
    bool vis[MAXN];                //BFS分层使用

    void init(int n)
    {
        this->n = n;
        edges.clear();
        for (int i = 0; i <= n; i++) G[i].clear();
    }

    void AddEdge(int from, int to, LL cap)
    {
        edges.push_back(Edge(from, to, cap, 0));
        edges.push_back(Edge(to, from, 0, 0));
        m = edges.size();
        G[from].push_back(m - 2);
        G[to].push_back(m - 1);
    }

    bool BFS()//构造分层网络
    {
        memset(vis, 0, sizeof(vis));
        queue<int> Q;
        d[s] = 0;
        vis[s] = true;
        Q.push(s);
        while (!Q.empty())
        {
            int x = Q.front(); Q.pop();
            for (int i = 0; i < G[x].size(); i++)
            {
                Edge& e = edges[G[x][i]];
                if (!vis[e.to] && e.cap > e.flow)
                {
                    vis[e.to] = true;
                    d[e.to] = d[x] + 1;
                    Q.push(e.to);
                }
            }
        }
        return vis[t];
    }

    LL DFS(int x, LL a)//沿阻塞流增广
    {
        if (x == t || a == 0) return a;
        LL flow = 0, f;
        for (int& i = cur[x]; i < G[x].size(); i++)//从上次考虑的弧
        {
            Edge& e = edges[G[x][i]];
            if (d[x] + 1 == d[e.to] && (f = DFS(e.to, min(a, e.cap - e.flow))) > 0)//多路增广
            {
                e.flow += f;
                edges[G[x][i]^1].flow -= f;
                flow += f;
                a -= f;
                if (a == 0) break;
            }
        }
        return flow;
    }

    LL MaxFlow(int s, int t)
    {
        this->s = s; this->t = t;
        LL flow = 0;
        while (BFS())
        {
            memset(cur, 0, sizeof(cur));
            flow += DFS(s, INF);
        }
        return flow;
    }

}gao;

int main()
{
    int n, m; scanf("%d%d", &n, &m);
    int s = 0, t = n + m + 1;
    LL sum = 0;
    gao.init(t);
    for (int i = 1; i <= n; i++)
    {
        int a; scanf("%d", &a);
        gao.AddEdge(i + m, t, a);
    }
    for (int i = 1; i <= m; i++)
    {
        int u, v, w; scanf("%d%d%d", &u, &v, &w);
        gao.AddEdge(s, i, w);
        gao.AddEdge(i, u + m, INF);
        gao.AddEdge(i, v + m, INF);
        sum += w;
    }
    sum -= gao.MaxFlow(s, t);
    printf("%lld\n", sum);
    return 0;
}
/*
4 5
1 5 2 2
1 3 4
1 4 4
3 4 5
3 2 2
4 2 2
*/