摘要: 不会sap,邻接矩阵过。#include <cstdlib>#include <cstring>#include <cstdio> #include <queue>#define MAXN 375#define INF 0x3f3f3f3fusing namespace std;int cap[MAXN+1][MAXN+1], flow[MAXN+1][MAXN+1], N;int p[MAXN+1], c[MAXN+1];int seq[25][15], maxflow;inline void init(){ maxflow = 0; mems 阅读全文
posted @ 2012-03-31 16:01 沐阳 阅读(194) 评论(0) 推荐(0) 编辑