Kuhn-Munkres算法模板（二分图最大权匹配）

讲解https://blog.csdn.net/thundermrbird/article/details/52231639

代码https://blog.csdn.net/pi9nc/article/details/12250247

int n;
int weight[MAX][MAX];
int boy[MAX];
bool sx[MAX],sy[MAX];
bool max_match(int gg)
{
    sx[gg]=true;
    for(int i=0;ilx[i])
            {
                lx[i]=weight[i][j];
            }
        }
    }
    for(int i=0;i=0)
        {
            sum+=weight[boy[i]][i];
        }
    }
    if(sign) sum=-sum;
    return sum;
}

转载于:https://www.cnblogs.com/LandingGuy/p/9280219.html