摘要：
#include<iostream>#include <cstdio>#include <string.h>using namespace std;int n,m;int c[201][201];int maxflow(int s,int t){ int p,q,queue[201],u,v,pre[201]; int flow,aug; flow=0; while(true) { memset(pre,-1,sizeof(pre)); for(queue[p=q=0]=s;p<=q;p++) { u... 阅读全文
摘要：
#include <iostream>#include <string.h>using namespace std; #include <queue>#define min(x,y) (x<y?x:y)const int inf = 1000000000;const int maxn = 210;int cap[maxn][maxn];int n,m;int s,t;int flow[maxn][maxn],d[maxn],parent[maxn],maxflow; void Edmonds_Karp(int s,int t,int nnum){ ma 阅读全文