hdu3549 Flow Problem【最大流】

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3549
题意：求1到n的最大流
解析：最大流裸题

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1205;
const int inf = 0x7fffffff;
struct node
{
    int to,rev,cap;
    node() {}
    node(int _to,int _cap,int _rev)
    {
        to = _to;
        rev = _rev;
        cap = _cap;
    }
};
vector<node>G[maxn];
int vis[maxn];
void addedge(int u,int v,int cap)
{
    G[u].push_back(node(v,cap,G[v].size()));
    G[v].push_back(node(u,0,G[u].size()-1));
}
int dfs(int v,int t,int f)
{
    if(v==t)
        return f;
    vis[v] = 1;
    for(unsigned i=0;i<G[v].size();i++)
    {
        node &e = G[v][i];
        if(!vis[e.to] && e.cap>0)
        {
            int d = dfs(e.to,t,min(e.cap,f));
            if(d>0)
            {
                e.cap -= d;
                G[e.to][e.rev].cap += d;
                return d;
            }
        }
    }
    return 0;
}
int flow(int s,int t)
{
    int res = 0;
    while(true)
    {
        memset(vis,0,sizeof(vis));
        int f = dfs(s,t,inf);
        if(f==0)
            return res;
        else
            res += f;
    }
}
int main(void)
{
    int t,case_t = 1;
    scanf("%d",&t);
    while(t--)
    {
        memset(G,0,sizeof(G));
        int n,m;
        scanf("%d %d",&n,&m);
        for(int i=0;i<m;i++)
        {
            int u,v,c;
            scanf("%d %d %d",&u,&v,&c);
            addedge(u,v,c);
        }
        printf("Case %d: %d\n",case_t++,flow(1,n));
    }
    return 0;
}