fzu 2039(二分图匹配)

题意：有p个人，d条狗，然后会给出有一些人不喜欢一些狗就不会购买，问最多能卖多少狗。。

题解：二分图求最大匹配，匈牙利算法。。第一次做这种题，发现一个博客里写的很好，分享一下。

http://blog.csdn.net/hackbuteer1/article/details/7398008

#include <stdio.h>
#include <string.h>
const int N = 105;
int n, t = 1, peo, dog, cases;
int g[N][N];
int vis[N];
int link[N];

int dfs(int u) {
	for (int i = 1; i <= dog; i++) {
		if (!vis[i] && g[u][i]) {
			vis[i] = 1;
			if (link[i] == -1 || dfs(link[i])) {
				link[i] = u;
				return true;
			}
		}
	}
	return false;
}

int main() {
	scanf("%d", &cases);
	while (cases--) {
		scanf("%d%d%d", &peo, &dog, &n);
		memset(g, 1, sizeof(g));
		memset(link, -1, sizeof(link));
		int a, b;
		for (int i = 0; i < n; i++) {
			scanf("%d%d", &a, &b);
			g[a][b] = 0;
		}
		int res = 0;
		for (int i = 1; i <= peo; i++) {
			memset(vis, 0, sizeof(vis));
			if (dfs(i))
				res++;
		}
		printf("Case %d: %d\n", t++, res);
	}
	return 0;
}