#include "stdio.h" //poj 1149 最大流#include "string.h"#include "queue"using namespace std;#define N 2250#define INF 0x3fffffffstruct node{ int u,v,w; int next;}edge[8*N];int n,idx;int start,end;int route[N],maxf[N],head[N],last[N];int EK();int BFS();void init();void adde(int u,int v,int w);void addedge(int u,int v,int w);int MIN(int x,int y){ return x q; q.push(start); while(!q.empty()) { x = q.front(); q.pop(); for(i=head[x];i!=-1;i=edge[i].next) { y = edge[i].v; if(route[y]==-1 && edge[i].w>0) { maxf[y] = MIN(maxf[x],edge[i].w); route[y] = i; q.push(y); } } } route[0] = -1; if(route[end]==-1) return 0; return maxf[end];}//http://www.cnblogs.com/rainydays/archive/2011/08/27/2155710.html