Pagini recente » Cod sursa (job #2764036) | Cod sursa (job #3214195) | Cod sursa (job #88241) | Cod sursa (job #264023) | Cod sursa (job #1191074)
#include <iostream>
#include <fstream>
#include <algorithm>
#define pinf 100000
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
int N,M;
int capacitate[5005][5005],flux[5005][5005];
int lant[5005],q[5009],viz[5005];
int pq,nq;
void citire(int &N, int &M)
{
int x,y,capac;
f>>N>>M;
for(int i=1;i<=M;i++)
{
f>>x>>y>>capac;
capacitate[x][y]=capac;
}
}
int bf(int s, int t)
{int x;
for(int i=1;i<=N;i++)
{
viz[i]=-1;
q[i]=0;
}
pq=nq=1;
q[pq]=s;
viz[s]=0;
lant[s]=-1;
while (pq<=nq)
{
x=q[pq];
viz[x]=1;
for(int i=1;i<=N;i++)
{
if(viz[i]==-1 && capacitate[x][i]-flux[x][i]>0)
{
q[++nq]=i;
viz[i]=0;
lant[i]=x;
}
}
pq++;
}
if(viz[t]==1) return 1;
return 0;
}
int Ford(int s, int t)
{
int i;
int fluxmaxim=0;
while (bf(s,t))
{
int x=pinf;
for (i=N;lant[i]>0;i=lant[i])
x=min(x,capacitate[lant[i]][i]-flux[lant[i]][i]);
for (i=N;lant[i]>0;i=lant[i])
{
flux[lant[i]][i]+=x;
flux[i][lant[i]]-=x;
}
fluxmaxim+=x;
}
return fluxmaxim;
}
int main()
{
citire(N,M);
g<<Ford(1,N);
return 0;
}