poj 1273 Drainage Ditches---EK求最大流

EK求最大流

EK算法的模板。。

#include<stdio.h>
#include<string.h>
#include<queue>
#include<algorithm>
using namespace std;

int cap[220][220],flow[220][220],a[220],pre[220];
int m,f;
int KE(int s,int t)
{
	queue<int> q;
	memset(flow,0,sizeof(flow));
	memset(pre,0,sizeof(pre));
	f=0;
	while(1)
	{
		q.push(s);
		memset(a,0,sizeof(a));
		a[s]=20000000;
		while(!q.empty()){
			int u=q.front();
			q.pop();
			for(int v=1;v<=m;v++){
				if(!a[v] && cap[u][v] > flow[u][v]){
					a[v]=min(a[u],cap[u][v]-flow[u][v]);
					q.push(v);
					pre[v]=u;
				}
			}
		
		}
		if(a[t]==0) break;
		for(int i=t;i!=s;i=pre[i]){
			flow[pre[i]][i] += a[t];
			flow[i][pre[i]] -= a[t];
		}
		f += a[t];
	}
	return f;
}
int main()
{
	int i,j,k;
	int n;
	int t1,t2,t3;
	while(scanf("%d%d",&n,&m)!=EOF){
		memset(cap,0,sizeof(cap));
		while(n--){
			scanf("%d%d%d",&t1,&t2,&t3);
			cap[t1][t2] += t3;  //可能有重边
		}
		int ans=KE(1,m);
		printf("%d\n",ans);
	}
}