POJ1273-Drainage Ditches

 Ford-Fulkerson方法求网络流，但是貌似还有一点问题，只适用于源为1，汇为n的情况，慎用。。。

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath> 
#include <string>
#include <iostream>
#include <algorithm>
#include <queue>
//===================
#include <stack>
#include <map>
#include <utility>

#define MAXN 300
#define MIN(A,B) ((A<B)?(A):(B))
#define INF 0x1F1F1F1F 
using namespace std;

int cap[MAXN][MAXN]={0};
int n=0,m=0;

int FordFulkerson(int s,int t)
{
	int ret=0;
	int a[MAXN];
	bool visited[MAXN];
	int flow[MAXN][MAXN];
	int pre[MAXN];
	int u=0;
	queue<int> q;
	memset(flow,0,sizeof(flow));
	while (true)
	{
		memset(visited,0,sizeof(visited));
		memset(a,0,sizeof(a));
		a[s]=INF;
		visited[s]=true;
		q.push(s);
		while (!q.empty())
		{
			u=q.front();
			q.pop();
			for (int i=1;i<=t;++i)
			{
				if (!visited[i] && cap[u][i]-flow[u][i]>0)
				{
					visited[i]=true;
					a[i]=MIN(a[u],cap[u][i]-flow[u][i]);
					pre[i]=u;
					q.push(i);
				}
			}
		}
		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];
		}
		ret+=a[t];
	}
	return ret;
}

int main()
{
	ios::sync_with_stdio(false);
	int u,v,w;
	while(cin>>m >>n)
	{
		memset(cap,0,sizeof(cap));
		for (int i=1;i<=m;++i)
		{
			cin>>u>>v>>w;
			cap[u][v]+=w;
		}
		cout<<FordFulkerson(1,n)<<endl;
	}
	return 0;
}