【HDU】 3549 Flow Problem

Flow Problem

---

题目链接

• Flow Problem

---

题目大意

完完全全的一个最大流模板题…跟我上面一篇文章的代码简直一模一样…唯一不同的地方就是多加了一个T…

---

题解

最大流模板。

---

代码

#include <iostream>#include <cstdio>#include <cstring>#include <cstdlib>using namespace std;int u,v,dist,a[205][205],flow[205],pre[205],q[205],n,m;int bfs(int s,int des){    memset(q,0,sizeof(q));    memset(pre,0,sizeof(pre));    int h=0,t=0;    q[h++]=s; flow[s]=0x7fffffff;    pre[s]=s; flow[des]=0;    while (h!=t)    {        int u=q[t];        if (u==des) break;        for (int v=1;v<=m;v++) if (a[u][v]>0 && !pre[v])        {            q[h++]=v; pre[v]=u;            flow[v]=min(flow[u],a[u][v]);        }        t++;    }    return flow[des];}int maxflow(int s,int des){    int t,ans=0;    while(t=bfs(s,des),t!=0)    {        for (int i=des;i!=s;i=pre[i])        {            a[pre[i]][i]-=t;            a[i][pre[i]]+=t;        }        ans+=t;    }    return ans;}int main(){    int T,Case=1;    scanf("%d",&T);    while (T--)    {        scanf("%d%d",&m,&n);        memset(a,0,sizeof(a));        for (int i=1;i<=n;i++)        {            scanf("%d%d%d",&u,&v,&dist);            a[u][v]+=dist;        }        int ans=maxflow(1,m);        printf("Case %d: %d\n",Case++,ans);    }    return 0;}