Pagini recente » Cod sursa (job #360473) | Cod sursa (job #3231899) | Cod sursa (job #369204) | Cod sursa (job #1902386) | Cod sursa (job #1679339)
#include <fstream>
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
short n, m, x, y;
int capacitate[1010][1010], c, aux;
int flux[1010][1010], minminus, minplus, fluxparcurgere;
int coada[1010], p, u, sumaflux;
int tata[1010];
bool viz[1010];
int main()
{
fin>>n>>m;
for(int i=1;i<=m;i++)
{
fin>>x>>y>>c;
capacitate[x][y]=c;
}
while(1)
{
tata[n]=0;
for(int i=1;i<=n;i++)
viz[i]=0;
coada[1]=1;
viz[1]=1;
p=u=1;
while(p<=u && tata[n]==0)
{
for(int i=1;i<=n;i++)
if(!viz[i])
{
if(capacitate[coada[p]][i]>flux[coada[p]][i])
{
coada[++u]=i;
viz[i]=1;
tata[i]=coada[p];
}
}
p++;
}
if(tata[n]==0)
break;
for(int j=1;j<n;++j)
{
if(tata[j]>0 && capacitate[j][n]>flux[j][n])
{
tata[n]=j;
aux=n;
minplus=1000000000;
while(tata[aux])
{
minplus=min(minplus,capacitate[tata[aux]][aux]-flux[tata[aux]][aux]);
aux=tata[aux];
}
if(minplus==0) continue;
aux=n;
while(tata[aux])
{
flux[tata[aux]][aux]+=minplus;
flux[aux][tata[aux]]-=minplus;
aux=tata[aux];
}
sumaflux+=minplus;
}
}
}
fout<<sumaflux;
return 0;
}