![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM_二分图匹配
defense881
Noting is impossiable!Believe in yourself!
展开
-
poj 1325 Machine Schedule(二分图的最小点覆盖)
Machine ScheduleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12035 Accepted: 5129DescriptionAs we all know, machine scheduling is a very clas原创 2014-11-09 00:35:03 · 790 阅读 · 0 评论 -
HDU 2063过山车(简单二分图匹配)
过山车 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11480 Accepted Submission(s): 5054原创 2014-10-27 23:46:17 · 594 阅读 · 0 评论 -
HDU 3395Special Fish(二分图的最大权匹配)
B - Special FishTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThere is a kind of special fish in the East Lake where is原创 2014-10-28 23:32:25 · 735 阅读 · 0 评论 -
二分图大讲堂——彻底搞定最大匹配数(最小覆盖数)、最大独立数、最小路径覆盖、带权最优匹配(转)
二分图大讲堂——彻底搞定最大匹配数(最小覆盖数)、最大独立数、最小路径覆盖、带权最优匹配(转)文本内容框架:§1图论点、边集和二分图的相关概念和性质§2二分图最大匹配求解匈牙利算法、Hopcroft-Karp算法§3二分图最小覆盖集和最大独立集的构造§4二分图最小路径覆盖求解§5二分图带权最优匹配求解Kuhn-Munkers算法转载 2014-10-30 17:59:46 · 1049 阅读 · 0 评论 -
HDU 2255 奔小康赚大钱(二分图的最大带权匹配 裸的KM算法)
奔小康赚大钱 点击打开题目链接Time Limit: 1000/1000 MS (Java/Others) Memory Limit:原创 2014-11-01 12:59:31 · 814 阅读 · 0 评论 -
poj 1469 COURSES(判断是否是存在不匹配的点(对于右边的点集来说))
COURSESTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17858 Accepted: 7038DescriptionConsider a group of N students and P courses. Each student v原创 2014-11-01 13:15:35 · 648 阅读 · 0 评论 -
poj 1422&&HDU 1151 Air Raid(最小路径覆盖)
Air Raid点击打开题目链接Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6781 Accepted: 4045DescriptionConsider a town where all the streets are one-way an原创 2014-11-01 15:44:21 · 648 阅读 · 0 评论 -
HDU 2458Kindergarten(二分图 最大团点数)
KindergartenTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 785 Accepted Submission(s): 443Problem DescriptionIn a kindergart原创 2014-11-01 12:54:00 · 715 阅读 · 0 评论