poj1273&&hdu1532

题解：

双倍经验

dinic模板题

然后ff过不了。。。

代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int N=;
int q[N*N],n,m,sum,dis[N],x,y,ans,f[N],z,a[N][N];
int bfs()
{
    memset(dis,0xff,sizeof dis);
    dis[]=;
    int l=,r=;
    q[]=;
    while (l<r)
     {
         int j=q[++l];
         for (int i=;i<=n;i++)
          if (dis[i]<&&a[j][i]>)
           {
               dis[i]=dis[j]+;
               q[++r]=i;
           }
     }
    if (dis[n]>)return ;
    return ;
}
int find(int x,int low)
{
    int b=;
    if (x==n)return low;
    for (int i=;i<=n;i++)
     if (a[x][i]>&&dis[i]==dis[x]+&&(b=find(i,min(low,a[x][i]))))
      {
          a[x][i]-=b;
          a[i][x]+=b;
          return b;
      }
    return ;
}
int main()
{
    while (~scanf("%d%d",&m,&n))
     {
         memset(a,,sizeof a);
        while (m--)
          {
             scanf("%d%d%d",&x,&y,&z);
             a[x][y]+=z;
         }
        ans=;int t;
        while (bfs())
         while (t=find(,0x7fffffff))
          ans+=t;
        printf("%d\n",ans);
     }
}