Pagini recente » Cod sursa (job #121003) | Cod sursa (job #1142373) | Cod sursa (job #2246026) | Cod sursa (job #1153980) | Cod sursa (job #952777)
Cod sursa(job #952777)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fi("maxflow.in");
ofstream fo("maxflow.out");
int i,j,n,m,c[1001][1001],cr[1001][1001],viz[1001],cd[10001],f[1001][1001],t[1001],fmin,rsa[10001],flux;
int BFS()
{
for (i=1; i<=n; i++) viz[i]=0;
int st=1,dr=1;
cd[1]=1;
while (st<=dr)
{
int nod=cd[st++];
for (i=1; i<=n; i++)
{
if (c[nod][i]>f[nod][i] && !viz[i])
{
viz[i]=1;
t[i]=nod;
cd[++dr]=i;
}
}
}
return viz[n];
}
int main(){
fi >> n >> m;
for (i=1; i<=m; i++)
{
int x,y,z;
fi >> x >> y >> z;
c[x][y]=cr[x][y]=z;
}
while (BFS())
{
for (i=1; i<=n; i++)
{
if (c[i][n]>f[i][n])
{
int fmin=c[i][n]-f[i][n];
for (j=i; j!=1; j=t[j])
fmin=min(fmin,c[t[j]][j]-f[t[j]][j]);
for (j=i; j!=1; j=t[j])
{
f[t[j]][j]+=fmin;
f[j][t[j]]-=fmin;
}
f[i][n]+=fmin;
f[n][i]-=fmin;
flux+=fmin;
}
}
}
fo << flux;
return 0;
}