Dinic模板（附带当前弧优化）

数组定义大小根据题目需要确定，参考了Flaze的博客。最大流最小割的题重在建图，图建立好后套上模板基本上就没问题。

struct EDGE {    int v,nxt,r;}e[maxn*maxn<<2];int cur[maxn*maxn],dis[maxn*maxn],head[maxn*maxn],edge=0,source,sink,sum=0;inline void adde(int u,int v,int r) {    e[edge].nxt=head[u],e[edge].v=v,e[edge].r=r,head[u]=edge++;    e[edge].nxt=head[v],e[edge].v=u,e[edge].r=0,head[v]=edge++;}inline bool bfs() {    queue<int> q;    memset(dis,-1,sizeof(dis)),    dis[source]=0,q.push(source);    while (!q.empty()) {        int p=q.front();q.pop();        for (int i=head[p];~i;i=e[i].nxt) {            int v=e[i].v;            if (e[i].r>0&&dis[v]==-1)                dis[v]=dis[p]+1,q.push(v);        }    }    return ~dis[sink];}int dfs(int p,int low) {    if (p==sink||low==0) return low;    int flow,cost=0;    for (int &i=cur[p];~i;i=e[i].nxt) {        int v=e[i].v;        if (e[i].r>0&&dis[v]==dis[p]+1&&(flow=dfs(v,min(low,e[i].r)))) {            e[i].r-=flow,            e[i^1].r+=flow,            low-=flow,            cost+=flow;            if (low==0) return cost;        }    }    if (low>0) dis[p]=-1;    return cost;}int dinic() {    int min_cut=0,a;    while (bfs()) {        for (int i=source;i<=sink;++i) cur[i]=head[i];        while (a=dfs(source,INF)) min_cut+=a;    }    return min_cut;}