网络最大流入门题目,写个模板以后自己看着玩。。。
#include <iostream>
#include <cstdio>
#include <queue>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#define maxn 210
using namespace std;
struct Edge
{
int to,cap,rev;
};
vector<Edge>G[maxn];
int level[maxn],iter[maxn];
void AddEdge(int from,int to,int cap)
{
Edge from_edge,to_edge;
from_edge={to,cap,G[to].size()};
to_edge={from,0,G[from].size()-1};
G[from].push_back(from_edge);
G[to].push_back(to_edge);
}
void BFS(int s)
{
memset(level,-1,sizeof level);
queue<int>Q;
Q.push(s);
level[s]=0;
while(!Q.empty())
{
int v=Q.front();Q.pop();
for(int i=0;i<G[v].size();i++)
{
Edge &e=G[v][i];
if(e.cap>0&&level[e.to]<0)
{
level[e.to]=level[v]+1;
Q.push(e.to);
}
}
}
}
int dfs(int v,int t,int f)
{
if(v==t)return f;
for(int &i=iter[v];i<G[v].size();i++)
{
Edge &e=G[v][i];
if(e.cap>0&&level[v]<level[e.to])
{
int d=dfs(e.to,t,min(f,e.cap));
if(d>0){
e.cap-=d;
G[e.to][e.rev].cap+=d;
return d;
}
}
}
return 0;
}
int max_flow(int s,int t)
{
int flow=0;
while(1){
BFS(s);
if(level[t]<0)return flow;
memset(iter,0,sizeof iter);
int f;
while((f=dfs(s,t,(1<<30)))>0)
{
flow+=f;
}
}
}
void init()
{
for(int i=0;i<=maxn;i++)G[i].clear();
}
int main()
{
// freopen("in.txt","r",stdin);
int n,m;
while(~scanf("%d%d",&n,&m))
{
init();
for(int i=0;i<n;i++)
{
int a , b, c;
scanf("%d%d%d",&a,&b,&c);
AddEdge(a,b,c);
}
printf("%d\n",max_flow(1,m));
}
return 0;
}