【算法学习】网络流模板……

网络流最大流（最小割）Dinic模板……

const int INF=99999999;
const int Maxn=;
const int Maxm=;
inline int Min(int p,int q){return p<q?p:q;}
int n,m,h[Maxn+5],to[Maxm*2+5],cap[Maxm*2+5],nxt[Maxm*2+5],tot=1,Sum=0,que[Maxn+5],l,r,lv[Maxn+5],iter[Maxn+5];
inline void ins(int x,int y,int c){nxt[++tot]=h[x];to[tot]=y;cap[tot]=c;h[x]=tot;}
inline void INS(int x,int y,int c){ins(x,y,c);ins(y,x,0);}

inline bool lvl() {
    memset(lv,0,sizeof lv);
    int u;
    l=r=1; que[1]=0; lv[0]=1;
    while(l<=r) {
        u=que[l++];
        eF(i,u) if(!lv[to[i]]&&cap[i]) {
            lv[to[i]]=lv[u]+1;
            que[++r]=to[i];
        }
    }
    return lv[T];
}
int flow(int u,int f) {
    if(u==T) return f;
    int d,sum=0;
    for(int&i=iter[u];i;i=nxt[i]) if(lv[to[i]]==lv[u]+1&&cap[i]) {
        d=flow(to[i],Min(f,cap[i]));
        sum+=d; f-=d;
        cap[i]-=d; cap[i^1]+=d;
        if(!f) return sum;
    }
    return sum;
}
int Dinic() {
    int ans=0;
    while(lvl()) {
        for(int i=0;i<=T;++i) iter[i]=h[i];
        ans+=flow(0,INF);
    }
    return ans;
}
int main() {
    init();
    printf("%d",Sum-Dinic());
}

没了……

init自己打 :(