【图论】二分图 匈牙利算法模板题 hdu2063 过山车

 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2063

这道题求的是二分图的最大匹配数。

#include<cstdio>
#include<cstring>
#include<algorithm>
#define MAX_N 510
using namespace std;
int k, N, M;
int line[MAX_N][MAX_N], used[MAX_N], girl[MAX_N];

bool Find(int x)
{
	for (int i = 1;i <= M;i++)
	{
		if (line[x][i] && !used[i])
		{
			used[i] = 1;
			if (girl[i] == 0 || Find(girl[i]))
			{
				girl[i] = x;
				return true;
			}
		}
	}
	return false;
}
int match()
{
	int sum = 0;
	for (int i = 1;i <= N;i++)
	{
		memset(used, 0, sizeof(used));
		if (Find(i)) sum++;
	}
	return sum;
}

int main()
{
	while (scanf("%d", &k) == 1)
	{
		memset(line, 0, sizeof(line));
		memset(girl, 0, sizeof(girl));
		if (k == 0) break;
		scanf("%d%d", &N, &M);
		while (k--)
		{
			int u, v;
			scanf("%d%d", &u, &v);
			line[u][v] = 1;
		}
		printf("%d\n", match());
	}
	return 0;
}