wind的网络流神模板--【秒过。。】【网络流】

在被刘汝佳接连坑了两次之后决定不再用刘汝佳的网络流了   

之后又找了一些模板   发现wind 的最给力了

const int maxn = 405;
const int maxm = maxn * maxn;
const int inf = 1000000000;

class Dinic {
public :
    struct Node {
        int u, v, f, next;
    }e[maxm];

    int head[maxn], p, lev[maxn], cur[maxn];
    int que[maxm];

    void init() {
        p = 0; 
        memset(head, -1, sizeof(head));
    }

    void add(int u, int v, int f) {
        e[p].u = u; e[p].v = v; e[p].f = f; e[p].next = head[u]; head[u] = p++;
        e[p].u = v; e[p].v = u; e[p].f = 0; e[p].next = head[v]; head[v] = p++;
    }

    bool bfs(int s, int t) {
        int u, v, qin = 0, qout = 0;
        memset(lev, 0, sizeof(lev)); lev[s] = 1; que[qin++] = s;
        while(qout != qin) {
            u = que[qout++];
            for(int i = head[u]; i != -1; i = e[i].next) {
                if(e[i].f > 0 && !lev[v = e[i].v]) {
                    lev[v] = lev[u] + 1, que[qin++] = v;
                    if(v == t) return 1;
                }
            }
        }
        return 0;
    }

    int dfs(int s, int t) {
        int i, f, qin, u, k;
        int flow = 0;
        while(bfs(s, t)) {
            memcpy(cur, head, sizeof(head));
            u = s, qin = 0;
            while(1) {
                if(u == t) {
                    for(k = 0, f = inf; k < qin; k++)
                        if(e[que[k]].f < f) f = e[que[i=k]].f;
                    for(k = 0; k < qin; k++)
                        e[que[k]].f -= f, e[que[k]^1].f += f;
                    flow += f, u = e[que[qin = i]].u;
                }
                for(i = cur[u]; cur[u] != -1; i = cur[u] = e[cur[u]].next)
                    if(e[i].f > 0 && lev[u] + 1 == lev[e[i].v]) break;
                if(cur[u] != -1)
                    que[qin++] = cur[u], u = e[cur[u]].v;
                else {
                    if(qin == 0) break;
                    lev[u] = -1, u = e[que[--qin]].u;
                }
            }
        }
        return flow;
    }
};

Dinic g;