最大流-Dinic算法模板

const int INF=0x3f3f3f3f;

struct Edge
{
	int from,to,cap,flow;
	Edge(int _from,int _to,int _cap,int _flow):from(_from),to(_to),cap(_cap),flow(_flow){}
};
struct Dinic
{
	int s,t;
	vector<Edge> edges;
	vector<int> G[MAXN];
	int d[MAXN]; bool vis[MAXN]; int cur[MAXN];
	void addEdge(int from,int to,int cap)
	{
		edges.push_back((Edge){from,to,cap,0});
		edges.push_back((Edge){to,from,0,0});
		int tt=edges.size();
		G[from].push_back(tt-2);
		G[to].push_back(tt-1);
	}
	bool BFS()
	{
		memset(vis,0,sizeof(vis));
		queue<int>Q;
		Q.push(s);
		d[s]=0;
		vis[s]=1;
		while(!Q.empty())
		{
			int x=Q.front(); Q.pop();
			for(int i=0;i<G[x].size();++i)
			{
				Edge &e =edges[G[x][i]];
				if(!vis[e.to] && e.cap>e.flow)
				{
					vis[e.to]=1;
					d[e.to]=d[x]+1;
					Q.push(e.to);
				}
			}
		}
		return vis[t];
	}
	int DFS(int x,int a)
	{
		if(x==t || a==0) return a;
		int flow=0,f;
		for(int&i=cur[x];i<G[x].size();++i)
		{
			Edge& e=edges[G[x][i]];
			if(d[x]+1==d[e.to] && (f=DFS(e.to,min(a,e.cap-e.flow)))>0)
			{
				e.flow+=f;
				edges[G[x][i]^1].flow-=f;
				flow+=f;
				a-=f;
				if(a==0) break;
			}
		}
		return flow;
	}
	int MF(int s,int t)
	{
		this->s=s; this->t=t;
		int flow=0;
		while(BFS())
		{
			memset(cur,0,sizeof(cur));
			flow+=DFS(s,INF);
		}
		return flow;
	}
}dinic;

使用的时候通过dinic.addEdge(from,to,cap)进行建图，通过dinic.MF(s,t)运行算法，返回值就是最大流