Pagini recente » Cod sursa (job #2430174) | Cod sursa (job #1741085) | Cod sursa (job #1582598) | Cod sursa (job #2760092) | Cod sursa (job #2768751)
#include<stdio.h>
#define N 1001
int i,j,n,m,y,l,k,w[N],g[N][N],e[N][N],b[N],c[5*N];
int main()
{
freopen("maxflow.in","r",stdin),freopen("maxflow.out","w",stdout),scanf("%d%d",&n,&m);
while(m--)
scanf("%d%d%d",&i,&j,&l),g[i][w[i]++]=j,g[j][w[j]++]=i,e[i][j]+=l;
while(1) {
for(j=1;j<=n;j++)
b[j]=0;
for(j=c[0]=c[1]=1;j<=c[0]&&!b[n];j++)
for(k=c[j],i=0;i<w[k];i++)
if(!b[g[k][i]]&&e[k][g[k][i]])
b[c[++c[0]]=g[k][i]]=k;
if(!b[n])
break;
for(i=0;i<w[n];i++)
if(b[g[n][i]]&&e[g[n][i]][n]) {
for(l=N*N,j=k=g[n][i],b[n]=k;j>1;j=b[j])
l=l>e[b[j]][j]?e[b[j]][j]:l;
for(l=l>e[k][n]?e[k][n]:l,y+=l,j=n;j>1;j=b[j])
e[b[j]][j]-=l,e[j][b[j]]+=l;
}
}
printf("%d",y);
return 0;
}