做这个题是看到另一个刚关注我的童鞋博客的一篇网络流题目总结,说这个题是二分图匹配。也看了看,不难,就顺手做了做。
奶牛喜欢哪个棚子就给它连上线,边权是1即可,构造二分图,求最大匹配数。
#include <iostream> using namespace std; #define MAXN 205 #define _clr(x) memset(x,0xff,sizeof(int)*MAXN) int map[MAXN][MAXN]; int hungary(int m, int n, int mat[][MAXN], int* match1, int* match2)//m for big { int s[MAXN], t[MAXN], p, q, ret = 0, i, j, k; for (_clr(match1), _clr(match2), i = 1; i <= m; ret += (match1[i++] >= 0)) for (_clr(t), s[p = q = 0] = i; p <= q&&match1[i] < 0; p++) for (k = s[p], j = 1; j <= n&&match1[i] < 0; j++) if (mat[k][j] && t[j] < 0) { s[++q] = match2[j], t[j] = k; if (s[q] < 0) for (p = j; p >= 0; j = p) match2[j] = k = t[j], p = match1[k], match1[k] = j; } return ret; } int main() { int n, m; while (cin >> n >> m) { memset(map, 0, sizeof(map)); for (int i = 1; i <= n; i++) { int num; cin >> num; for (int j = 0; j < num; j++) { int temp; cin >> temp; map[i][temp] = 1; } } int match1[MAXN], match2[MAXN]; cout << hungary(n, m, map, match1, match2) << endl; } } |