ACM模板——二分图匹配

int a[maxn][maxn];
int linker[maxn];
int cnt = 0;
bool dfs(int u)
{
    _for(v,0,n)
        if(a[u][v] && !used[v])
        {
            used[v] = true;
            if(linker[v] == -1 || dfs(linker[v]))
            {
                linker[v] = u;
                return true;
            }
        }
    return false;
}
int hungry()
{
    int res = 0;
    memset(linker,-1,sizeof(linker));
    _for(u,0,n)
    {
        memset(used,false,sizeof(used));
        if(dfs(u))
            res    ++;
    }
    return res;
}