匈牙利算法求二分图最大匹配

​
#include <iostream>
#include <cstring>
using namespace std;
const int maxn = 505,maxm = 100005;
int h[maxn],e[maxm],ne[maxm],idx;
int n1,n2,m,match[maxn];
bool st[maxn];
void add(int a,int b)
{
    e[idx] = b,ne[idx] = h[a],h[a] = idx++;
}
bool find(int u)
{
    for(int i = h[u];i != -1;i = ne[i])
    {
        int j = e[i];
        if(!st[j])
        {//防止重复匹配
            st[j] = true;
            if(!match[j] || find(match[j]))
            {
                match[j] = u;
                return true;
            }
        }
    }
    return false;
}
int main()
{
    scanf("%d%d%d",&n1,&n2,&m);
    memset(h,-1,sizeof h);
    int u,v,res = 0;
    while(m--)
    {
        scanf("%d%d",&u,&v);
        add(u,v);
    }
    for(int i = 1;i <= n1;i++)
    {
        memset(st,false,sizeof st);
        if(find(i)) res++;
    }
    printf("%d\n",res);
    return 0;
}

​