Pagini recente » Cod sursa (job #424238) | Cod sursa (job #328196) | Cod sursa (job #1175769) | Cod sursa (job #1339945) | Cod sursa (job #1941646)
#include <fstream>
using namespace std;
ifstream fi("maxflow.in");
ofstream fo("maxflow.out");
const int Dim=1001;
const int Inf=0x3f3f3f3f;
int a[Dim][Dim],t[Dim],viz[Dim],n,m,flux_final;
void ReadGraph()
{
int x,y,c;
fi>>n>>m;
for (int i=1;i<=m;i++)
{fi>>x>>y>>c;
a[x][y]=c;}
}
void Dfs(int nod)
{
viz[nod]=true;
for(int i=1;i<=n;++i)
if (viz[i]==false)
if (a[nod][i]>0)
{
t[i]=nod;
Dfs(i);
}
}
int FluxMinim()
{
while (true)
{
for(int i=1;i<=n;++i) viz[i]=false;
Dfs(1);
if (viz[n]==false)break;
int fmax=Inf;
for (int i=n;i!=1;i=t[i])
fmax=min(fmax,a[t[i]][i]);
int i=n;
while (i!=1){
a[t[i]][i]-=fmax;
a[i][t[i]]+=fmax;
i=t[i];
}
flux_final+=fmax;
}
fo<<flux_final<<'\n';
}
int main()
{
ReadGraph();
FluxMinim();
return 0;
}