Pagini recente » Cod sursa (job #1978459) | Cod sursa (job #2904819) | Cod sursa (job #349041) | Cod sursa (job #2342591) | Cod sursa (job #2543062)
#include <fstream>
#define Nmax 1024
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
int n,m,viz[Nmax],T[Nmax],c[Nmax],ff=0,Ct[Nmax][Nmax],F[Nmax][Nmax];
int sursa,dest;
int bfs()
{
int p,x,u,i;
for(i=1;i<=n;i++)
viz[i]=0;
p=u=1;
c[1]=sursa;
while(p<=u)
{
x=c[p];
for(i=1;i<=n;i++)
if(Ct[x][i]-F[x][i]>0&&viz[i]==0)
{
c[++u]=i;
viz[i]=1;
T[i]=x;
}
p++;
}
return viz[dest];
}
int main()
{
int x,y,c,i,j,minn;
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y>>c;
Ct[x][y]=c;
}
sursa=1;
dest=n;
while(bfs())
for(i=1;i<=n;i++)
if(Ct[i][n]-F[i][n]>0)
{
minn=Ct[i][n]-F[i][n];
for(j=i;j!=1;j=T[j])
if(Ct[T[j]][j]-F[T[j]][j]<minn)
minn=Ct[T[j]][j]-F[T[j]][j];
for(j=i;j!=1;j=T[j])
{
F[T[j]][j]+=minn;
F[j][T[j]]-=minn;
}
F[i][n]+=minn;
F[n][i]-=minn;
ff+=minn;
}
g<<ff;
return 0;
}