二分匹配

代码：

#include<iostream>
#include<algorithm>
#include<queue>
#include<map>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<cmath>
#define N 909
using namespace std;
const int inf = 0x3f3f3f3f;
const int mod = 10000007;
int mp[N][N], m, n, k, used[N], match[N];
int Find(int u)
{
    for(int i = 1; i <= m; i++)
    {
        if(!used[i] && mp[u][i])
        {
            used[i] = 1;
            if(match[i] == -1 || Find(match[i]))
            {
                match[i] = u;
                return 1;
            }
        }
    }
    return 0;
}
int main()
{
    int i;
    while(scanf("%d", &k), k)
    {
        scanf("%d%d", &n, &m);
        memset(mp, 0, sizeof(mp));
        for(i = 1; i <= k; i++)
        {
            int a, b;
            scanf("%d%d", &a, &b);
            mp[a][b] = 1;
        }
        memset(match, -1, sizeof(match));
        int ans = 0;
        for(i = 1; i <= n; i++)
        {
            memset(used, 0, sizeof(used));
            ans += Find(i);
        }
        cout << ans << endl;
    }
    return 0;
}