最大流

//Foed-Fulkerson
struct edge{
	int to,cap,rev;
}; 
vector <edge> g[max];
bool used[max];
void addedge(int from,int to,int cap){
	g[from].push_back((edge){to,cap,g[to].size()});
	g[to].push_back((edge){from,0,g[from].size()-1});
}
int dfs(int v,int t,int f){
	if(v==t)	return f;
	used[v]=true;
	for(int i=0;i<g[v].size();i++){
		edge &e=g[v][i];
		if(!used[e.to ]&&e.cap >0){
			int d=dfs(e.to ,t,min(f,e.cap ));
			if(d>=){
				e.cap -=d;
				g[e.to ][e.rev ].cap+=d;
				return d;
			}
		}
	}
}
int maxflow(int s,int t){
	int flow=0;
	for(;;){
		memset(used,0,sizeof(used));
		int f=dfs(s,t,INF);
		if(f==0)	return flow;
		flow+=f;
	}
}