Kuhn-Munkres算法模板(二分图最大权匹配)
讲解https://blog.youkuaiyun.com/thundermrbird/article/details/52231639代码https://blog.youkuaiyun.com/pi9nc/article/details/12250247int n;
int weight[MAX][MAX];
int boy[MAX];
bool sx[MAX],sy[MAX];
bool max_match(int ...
转载
2018-04-30 18:17:25 ·
352 阅读 ·
0 评论