hdu3549 (dinic求最大流)

//hdu3549 (dinic求最大流)
#include<iostream>
#include<cstdio>
#include<string.h>
#include<queue>
using namespace std;
const int N=20;
int map[N][N];
int layer[N];
int n,m;
int sta,end;
int Min(int a,int b)
{
    if(a<b)
    {
       return a;
    }
    return b;
}
//======================主要算法
bool bfs()
{
    memset(layer,-1,sizeof(layer));
    queue<int> q;
    q.push(sta);
    layer[sta]=0;
    while(!q.empty())
    {
        int cur=q.front();
        q.pop();
        for(int i=1;i<=n;++i)
        {
           if(layer[i]==-1&&map[cur][i]>0)
           {
               layer[i]=layer[cur]+1;
               q.push(i);
           }
        }
    }
    if(layer[end]>=0)
    {
        return true;
    }
    return false;
}
int dinic(int t,int sum)
{
    int i;
    if(t==end)
    {
        return sum;
    }
    int os=sum;
    for(i=1;i<=n&∑i++)
    {
        if(layer[i]==layer[t]+1&&map[t][i]>0)
        {
            int a=dinic(i,Min(sum,map[t][i]));
            map[t][i]-=a;
            map[i][t]+=a;
            sum-=a;
        }
    }
    return os-sum;
}
//===========================
int main()
{
    int t;
    scanf("%d",&t);
    int k=1;
    while(t--)
    {
        int a,b,c;
        scanf("%d%d",&n,&m);
        sta=1;
        end=n;
        memset(map,0,sizeof(map));
        for(int i=0;i<m;i++)
        {
            scanf("%d%d%d",&a,&b,&c);
            map[a][b]+=c;
        }
        int ansmaxflow=0;
        while(bfs())
        {
            ansmaxflow+=dinic(1,99999999);
        }
        printf("Case %d: %d\n",k++,ansmaxflow);
    }
    return 0;
}