摘要：
http://acm.hdu.edu.cn/showproblem.php?pid=3572#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;const int MAXN = 3000;const int MAXM = 210000;const int INF =0x7ffffff;struct Edge{ int st, ed; int next; int flow;}edge[MAXM];int head[MAXN];int n,m,S,T,tot,d 阅读全文
