二分图最大匹配

二分图最大匹配
#include<iostream>
#include<stdio.h>
#include<cmath>
#include<algorithm>
#include<string>
#include<cstring>
#include<string.h>
#include<map>
#include<queue>
#include<stack>
#include<list>
#include<cctype>
#include<fstream>
#include<sstream>
#include<iomanip>
#include<set>
#include<vector>
#include<cstdlib>
#include<time.h>
using namespace std;
#define mem(x) memset(x,0,sizeof(x))
#define scanf(x) scanf("%d",&x)

int link[550][550];
int parter[550];
int book[550];
int gril, boy;

int find(int x)
{
    for (int i = 1; i <= boy; i++)
    {
        if (link[x][i] && book[i] == 0)//如果有边 且 未被搜索过
        {
            book[i] = 1;
            if (parter[i] == 0 || find(parter[i]))//如果该男孩没有搭档或者能够给该男孩另找到一搭档
            {
                parter[i] = x;
                return 1;
            }
        }
    }
    return 0;
}
int main()
{
    int n;
    while (cin>>n,n)
    {
        mem(link);
        mem(parter);
        cin >> gril >> boy;
        int a, b;
        for (int i = 1; i <= n; i++)
        {
            cin >> a >> b;
            link[a][b]=1;
        }
        int s = 0;
        for (int i = 1; i <= gril; i++)
        {
            mem(book);//每次匹配之前重置标记数组
            if (find(i))
                s++;
        }
        cout << s << endl;
    }
}

//最大独立集=定点数-最大匹配
//二分图中最小点覆盖等于最大匹配数
//二分图中最小边覆盖=顶点数-最小点覆盖（最大匹配）