网络流FF算法

#include <bits/stdc++.h>
#define int long long
struct ndoe{int ver,edge,next;}e[4000005];
int head[10000005],d[1000005],n,m,pre[100005],u,v,w,flow[1000005],adds,ans,tot=1,rec[1000005];
void add(int x,int y,int z){e[++tot].ver=y;e[tot].edge=z;e[tot].edge;e[tot].next=head[x];head[x]=tot;}
void addedge(int x,int y,int z){add(x,y,z);add(y,x,0);}
int dfs(int s,int t){
	std::stack< int > q;memset(pre,-1,sizeof(pre));pre[s]=s;flow[s]=1e9;q.push(s);
	while(q.size()){
		int top=q.top(),k=head[q.top()];q.pop();
		for(;k;k=e[k].next){
			if(pre[e[k].ver]==-1&&e[k].edge>0)  flow[e[k].ver]=std::min(flow[top],e[k].edge),pre[e[k].ver]=top,rec[e[k].ver]=k,q.push(e[k].ver);
		}
		if(pre[t]!=-1)  return flow[t];
	}
	return -1;
}
void ff(int s,int t){
	while((adds=dfs(s,t))!=-1){
		int i=t;ans+=adds;
		while(i!=s)  e[rec[i]].edge-=adds,e[rec[i]^1].edge+=adds,i=pre[i]; 
	}
}
signed main() {
	int s,t;scanf("%lld%lld%lld%lld",&n,&m,&s,&t);for(int i=1;i<=m;i++)  scanf("%lld%lld%lld",&u,&v,&w),addedge(u,v,w);
	ff(s,t);printf("%lld\n",ans);return 0; 
}