![](https://img-blog.csdnimg.cn/20201014180756923.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
匹配
果果_
这个作者很懒,什么都没留下…
展开
-
南阳理工OJ 239 月老的难题(匈牙利模板)
#include<stdio.h>#include<string.h>#include<vector>using namespace std;#define M 505vector<int>v[M];bool mask[M];int link[M];int n,k;bool findpath(int i){...2013-04-17 08:20:08 · 106 阅读 · 0 评论 -
hd2255 奔小康赚大钱(KM算法模板o(n^3))最大权匹配
连接:http://acm.hdu.edu.cn/showproblem.php?pid=2255 奔小康赚大钱Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1805 Accepted Submission(s): ...2013-04-30 09:30:32 · 67 阅读 · 0 评论 -
Uva 1411 - Ants(KM模板O(n^4))最大权匹配
连接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=560&problem=4157&mosmsg=Submission+received+with+ID+11685541 Young naturali...2013-04-30 09:33:30 · 101 阅读 · 0 评论 -
Uva 11419 - SAM I AM(最大匹配模板、找出最小覆盖点模板)
连接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=560&problem=2414&mosmsg=Submission+received+with+ID+11685942 Problem CSAM I...2013-04-30 12:26:28 · 113 阅读 · 0 评论