摘要：
简单二分匹配。代码如下：#include <cstring>#include <cstdlib>#include <cstdio>#define MAXN 205using namespace std;int N, M, G[MAXN][MAXN];int visit[MAXN], marry[MAXN];int path(int u){ for (int i = 1; i <= M; ++i) { if (!G[u][i] || visit[i]) { continue; } visit[i] = 1; if... 阅读全文
