Hdu 1532 Drainage Ditches - 最大流入门

裸的最大流的题目，直接模版。

下面是代码：

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

const int maxn = 300;
const int inf = 0xfffff;
int g[maxn][maxn];
int pre[maxn];
int maxflow;
int n,m;
void Edmonds_Karp(int s, int t,int m)
{
  while(1) {
    queue<int> q;
    int minflow = inf;
    q.push(s);
    memset(pre,0,sizeof(pre));

    while(!q.empty()){
      int u = q.front(); q.pop();
      if(u == t) break;
      for(int i = 1; i <= m; i++){
	if(g[u][i] > 0 && pre[i] == 0) {
	  pre[i] = u;
	  q.push(i);
	}
      }
    }
    if(pre[t] == 0) break;
    for(int i = t; i != s; i = pre[i])
     minflow = min(minflow,g[pre[i]][i]);
    for(int i = t; i != s; i = pre[i]){
      g[pre[i]][i] -= minflow;
      g[i][pre[i]] += minflow;
    }
    maxflow += minflow;
  }
}
int main()
{
  while(~scanf("%d%d",&n,&m)) {
    memset(g,0,sizeof(g));
    maxflow = 0;
    for(int i = 0; i < n; i++) {
      int u,v,c;
      scanf("%d%d%d",&u,&v,&c);
      g[u][v] += c;
    }
    Edmonds_Karp(1,m,m);
    printf("%d\n",maxflow);
  }
  return 0;
}