HDU1532Drainage Ditches(网络流入门+EK模板题)

是网络流的入门题，从EK开始网络流学习
EK通过BFS寻找增广路，然后更新最大流，直到找不到增广路。
学习资料

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<string>
#include<cstring>
#include<stack>
#include<queue>
#include<vector>
#include<cstdlib>
#define lson (rt<<1),L,M
#define rson (rt<<1|1),M+1,R
#define M ((L+R)>>1)
#define cl(a,b) memset(a,b,sizeof(a));
#define LL long long
#define P pair<int,int>
#define X first
#define Y second
#define pb push_back
#define fread(zcc)  freopen(zcc,"r",stdin)
#define fwrite(zcc) freopen(zcc,"w",stdout)
using namespace std;
const int maxn=205;
const int inf=1<<28;
int r[maxn][maxn];
bool vis[maxn];
int pre[maxn];
int n,m;
bool bfs(int s,int t){
    cl(pre,-1);
    cl(vis,false);
    queue<int> q;
    q.push(s);
    vis[s]=true;
    while(!q.empty()){
        int x=q.front();q.pop();
        for(int i=1;i<=m;i++){
            if(r[x][i]>0&&!vis[i]){
                pre[i]=x;
                vis[i]=true;
                if(i==t)return true;
                q.push(i);
            }
        }
    }
    return false;
}
int max_flow(int s,int t){
    int ans=0,d;
    while(bfs(s,t)){
        d=inf;
        for(int i=t;pre[i]!=-1;i=pre[i]){
            d=min(d,r[pre[i]][i]);
        }
        for(int i=t;pre[i]!=-1;i=pre[i]){
            r[pre[i]][i]-=d;
            r[i][pre[i]]+=d;
        }
        ans+=d;
    }
    return ans;
}

int main(){
    while(~scanf("%d%d",&n,&m)){
        cl(r,0);
        for(int i=0;i<n;i++){
            int u,v,x;
            scanf("%d%d%d",&u,&v,&x);
            r[u][v]+=x;
        }
        printf("%d\n",max_flow(1,m));
    }
    return 0;
}