POJ 1273~Drainage Ditches(网络最大流ek，dinic）

直接上模板吧，个人感觉EK算法比较好理解，dinic看了好久才看懂，毕竟智商有限。上代码

EK

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
#include<queue>
#define maxn 1000000000
queue<int >q;
int n,m,map[210][210],con[210][210],a[210],b[210];
int bfs(int s,int t)
{
    int f=0,u,v;
    memset(con,0,sizeof(con));
    while(1)
    {
        while(!q.empty()) q.pop();
        memset(a,0,sizeof(a));
        a[s]=maxn;
        q.push(s);
        while(!q.empty())//找增广路
        {
            u=q.front();
            q.pop();
            for(int i=1;i<=m;i++)
            {
                if(!a[i]&&map[u][i]>con[u][i])
                {
                    b[i]=u;
                    q.push(i);
                    a[i]=a[u]<(map[u][i]-con[u][i])? a[u]:(map[u][i]-con[u][i]);
                }
            }
        }
        if(a[t]==0) break;//无增广路，结束
        for(int i=t;i!=s;i=b[i])
        {
            con[b[i]][i]+=a[t];
            con[i][b[i]]-=a[t];
        }
        f+=a[t];
    }
    return f;
}
int main()
{
    int x,y,z,ans;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        memset(map,0,sizeof(map));
        for(int i=1; i<=n; i++)
        {
            scanf("%d%d%d",&x,&y,&z);
            map[x][y]+=z;
        }
        ans=bfs(1,m);
        printf("%d\n",ans);
    }
    return 0;
}

#include<iostream>
#include<queue>
#define maxn 100010
#define inf 10000000
#include<string.h>
using namespace std;
queue <int >q;
int s,t;
int head[maxn+2],dis[maxn+2],n,m,e;
struct ss
{
    int v,w,next;
};
ss map[2*maxn];
int min(int x,int y)
{
    return x<y? x:y;
}
void add(int u,int v,int w)
{
    map[e].v=v;
    map[e].w=w;
    map[e].next=head[u];
    head[u]=e++;
}
bool bfs()//分层
{
    memset(dis,0,sizeof(dis));
    while(!q.empty()) q.pop();
    dis[s]=1;
    q.push(s);
    while(!q.empty())
    {
        int temp=q.front();
        q.pop();
        for(int i=head[temp];i!=-1;i=map[i].next)
        {
            int temp2=map[i].v;
            if(dis[temp2]==0&&map[i].w)
            {
                dis[temp2]=dis[temp]+1;
                q.push(temp2);
                if(temp2==t) return true;
            }
        }
    }
    return false;
}
int dfs(int u,int f)//找最大流
{
    if(u==t||f==0) return f;
    int flow =0;
    for(int i=head[u];i!=-1;i=map[i].next)
    {
        int v=map[i].v;
        if(dis[v]==dis[u]+1&&map[i].w)
        {
            int tt=min(map[i].w,f-flow);
            int inc=dfs(v,tt);
            flow+=inc;
            map[i].w-=inc;
            map[i^1].w+=inc;
            if(f==flow) break;
        }

    }
    if(!flow) dis[u]=-1;
    return flow;
}
int dinic ()
{
    int ans=0;
    while(bfs()) {
            ans+=dfs(s,inf);
    }
    return ans;
}
int main()
{
    int u,v,w;
    while(cin>>m>>n)
    {
        memset(map,0,sizeof(map));
        memset(head,-1,sizeof(head));
        e=0;
        s=1;
        t=n;
        //cin>>n>>m;
        for(int i=0;i<m;i++)
        {
            cin>>u>>v>>w;
            add(u,v,w);
            add(v,u,0);
        }
        cout<<dinic()<<endl;
    }
    return 0;
}