HDU 3996 Gold Mine 最大权闭合图

题目：http://acm.hdu.edu.cn/showproblem.php?pid=3996

题意：有一个金矿，分成了很多区域，每个区域内又可以分成几部分，每部分有一定量的金子，挖掘金子有一定的花费。要挖掘某个区域内的某部分金子前，必须要把在它之上的金子挖掘出来。问最大收益是多少（初始有无限多的钱可以去挖金子）

思路：最大权闭合图，很简单，注意数据类型用long long，另外就是题意说的有点不明白，纠结题意很久，坑。。。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;

typedef long long ll;
const int N = 3010;
const ll INF = 0x3f3f3f3f3f3f3f3f;
struct edge
{
    int to, next;
    ll cap;
}g[N*300*2];
int head[N], pre[N], cur[N], gap[N], level[N];
int cnt, nv, cas = 0;
void add_edge(int v, int u, ll cap)
{
    g[cnt].to = u, g[cnt].cap = cap, g[cnt].next = head[v], head[v] = cnt++;
    g[cnt].to = v, g[cnt].cap = 0, g[cnt].next = head[u], head[u] = cnt++;
}
ll sap(int s, int t)
{
    memset(level, 0, sizeof level);
    memset(gap, 0, sizeof gap);
    memcpy(cur, head, sizeof head);
    gap[0] = nv;
    int v = pre[s] = s;
    ll flow = 0, aug = INF;
    while(level[s] < nv)
    {
        bool flag = false;
        for(int &i = cur[v]; i != -1; i = g[i].next)
        {
            int u = g[i].to;
            if(g[i].cap > 0 && level[v] == level[u] + 1)
            {
                flag = true;
                pre[u] = v;
                v = u;
                aug = min(aug, g[i].cap);
                if(v == t)
                {
                    flow += aug;
                    while(v != s)
                    {
                        v = pre[v];
                        g[cur[v]].cap -= aug;
                        g[cur[v]^1].cap += aug;
                    }
                    aug = INF;
                }
                break;
            }
        }
        if(flag) continue;
        int minlevel = nv;
        for(int i = head[v]; i != -1; i = g[i].next)
        {
            int u = g[i].to;
            if(g[i].cap > 0 && minlevel > level[u])
                minlevel = level[u], cur[v] = i;
        }
        if(--gap[level[v]] == 0) break;
        level[v] = minlevel + 1;
        gap[level[v]]++;
        v = pre[v];
    }
    return flow;
}
int main()
{
    int t, n, m, w, a, b;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d", &n);
        cnt = 0;
        memset(head, -1, sizeof head);
        ll sum = 0;
        for(int i = 1; i <= n; i++)
        {
            scanf("%d", &m);
            for(int j = 1; j <= m; j++)
            {
                scanf("%d%d%d", &a, &b, &w);
                sum += b;
                add_edge(0, 25 * (i-1) + j, b);
                add_edge(25 * (i-1) + j, n * 25 + 1, a);
                for(int k = 1; k <= w; k++)
                {
                    scanf("%d%d", &a, &b);
                    add_edge(25 * (i-1) + j, 25 * (a-1) + b, INF);
                }
            }
        }
        nv = 25 * n + 2;
        printf("Case #%d: %lld\n", ++cas, sum - sap(0, n * 25 + 1));
    }
    return 0;
}