Pagini recente » Cod sursa (job #2780744) | Cod sursa (job #266745) | Cod sursa (job #1879444) | Cod sursa (job #1105992) | Cod sursa (job #2752917)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
int N,M, x,y,z,flux;
int C[1005][1005], F[1005][1005], T[1005];
void citire()
{
fin>>N>>M;
for(int i=1;i<=M;i++)
{
fin>>x>>y>>z;
C[x][y]=z;
}
}
int BFS(int s,int d)
{
int p,u,nod,Q[1005];
memset(T,0,sizeof(T));
p=u=1;
Q[p]=s;
T[s]=-1;
while(p<=u)
{
nod=Q[p];
for(int i=1;i<=N;i++)
if(T[i]==0 && C[nod][i]>F[nod][i])
{
Q[++u]=i;
T[i]=nod;
if(i==d) return i;
}
p++;
}
return 0;
}
void flux_maxim()
{
int r,i;
int s=1, d=N;
for(flux=0; BFS(s,d); flux+=r)
{
r=110005;
i=d;
while(i!=s)
{
r=min(r, C[T[i]][i]-F[T[i]][i]);
i=T[i];
}
i=d;
while(i!=s)
{
F[T[i]][i]+=r;
F[i][T[i]]-=r;
i=T[i];
}
}
fout<<flux;
}
int main()
{
citire();
flux_maxim();
return 0;
}