HDU 3917 Road constructions（最大权闭合图）

题目地址
题意：有n个工程，m个公司，给出每个公司所有项目的税收，再给出k条两两工程的关系，以及政府补助和哪个公司能得到这个补助。问政府的最大盈利是多少。
思路：这个就是因为可以转化为最大权闭合图来解，所以政府能的到的最大价值=总税收-（没有入标的税收+要付出的补助）。这个最大权闭合图的建图方法感觉有点固定（如下图）

转自最小割模型在信息学竞赛中的应用这篇论文。可以到我的资源那里下这篇论文，觉得蛮值得学习一下

#include <iostream>
#include <cstring>
#include <string>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <iomanip>
#define N 6005
#define M 555005  
#define LL __int64
#define inf 0x3f3f3f3f
#define lson l,mid,ans<<1
#define rson mid+1,r,ans<<1|1
#define getMid (l+r)>>1
#define movel ans<<1
#define mover ans<<1|1
using namespace std;
const LL mod = 1000000007;
int head[N], level[N], cur[N];
int n, m, cnt;
struct node {
    int to;
    int cap;//剩余流量
    int next;
}edge[M];
struct nope {
    int u, v, id;
}road[N];
struct Dinic {
    void init() {
        memset(head, -1, sizeof(head));
        cnt = 0;
    }
    void add(int u, int v, int cap) {//有向图
        edge[cnt].to = v, edge[cnt].cap = cap, edge[cnt].next = head[u], head[u] = cnt++;
        edge[cnt].to = u, edge[cnt].cap = 0, edge[cnt].next = head[v], head[v] = cnt++;//反向边
    }
    bool bfs(int s, int t){
        memset(level, -1, sizeof(level));
        queue<int>Q;
        level[s] = 0;
        Q.push(s);
        while (!Q.empty()){
            int u = Q.front(); Q.pop();
            for (int i = head[u]; i + 1; i = edge[i].next){
                int v = edge[i].to;
                if (edge[i].cap>0 && level[v] == -1){
                    level[v] = level[u] + 1;
                    Q.push(v);
                }
            }
        }
        return level[t] != -1;
    }

    int dfs(int u, int t, int f){
        if (u == t) return f;
        for (int &i = cur[u]; i + 1; i = edge[i].next){
            int v = edge[i].to;
            if (edge[i].cap>0 && level[v] == level[u] + 1){
                int d = dfs(v, t, min(f, edge[i].cap));
                if (d>0){
                    edge[i].cap -= d;
                    edge[i ^ 1].cap += d;
                    return d;
                }
            }
        }
        return 0;
    }

    int dinic(int s, int t){
        int flow = 0;
        while (bfs(s, t)){
            for (int i = 0; i<N; i++) cur[i] = head[i];
            int f;
            while ((f = dfs(s, t, inf))>0)
                flow += f;
        }
        return flow;
    }
}dc;
int main() {
    cin.sync_with_stdio(false);
    int a, b, c, d;
    int k;
    int s, t;
    int sum;
    int num[N];
    while (cin >> n >> m) {
        if (n == 0 && m == 0) {
            break;
        }
        dc.init();
        sum = 0;
        s = 0;
        t = m + 1;
        memset(num, 0, sizeof(num));
        for (int i = 1; i <= m; i++) {
            cin >> a;
            dc.add(s, i, a);//起点连公司 税收为正值
            sum += a;
        }
        cin >> k;
        for (int i = 1; i <= k; i++) {
            cin >> a >> b >> c >> d;
            road[i].u = a;
            road[i].v = b;
            road[i].id = c;
            num[c] += d;//对应工程公司付费求和 减小建边次数
        }
        for (int i = 1; i <= m; i++) {
            dc.add(i, t, num[i]);//公司连终点
        }
        for (int i = 1; i <= k; i++) {
            for (int j = 1; j <= k; j++) {
                if (i != j&&road[i].v == road[j].u&&road[i].id != road[j].id) {
                    dc.add(road[i].id, road[j].id, inf);
                }
            }
        }
        cout << sum - dc.dinic(s, t) << endl;
    }
    return 0;
}