匈牙利算法
苏城yzw
这个作者很懒,什么都没留下…
展开
-
POJ 1469 二分图最大匹配 COURSES
Description Consider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committee of exactly P s原创 2014-07-28 12:25:30 · 378 阅读 · 0 评论 -
poj 1466 Girls and Boys 最大独立集=n-最小覆盖点
Description In the second year of the university somebody started a study on the romantic relations between the students. The relation "romantically involved" is defined between one girl and one bo原创 2014-07-28 15:33:47 · 345 阅读 · 0 评论 -
poj 3041 Asteroids 最小覆盖点==最大二分匹配
Description Bessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 Fortunately, Bessie has a powerful weapon that can vaporize all the astero原创 2014-07-28 13:57:48 · 373 阅读 · 0 评论 -
poj 2195 Going Home km算法
Description On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to an adjacent point. For each little原创 2014-07-29 09:21:53 · 326 阅读 · 0 评论 -
二分图最大匹配
RPG girls今天和大家一起去游乐场玩,终于可以坐上梦寐以求的过山车了。可是 ,过山车的每一排只有两个座位,而且还有条不成文的规矩,就是每个女生必须找 个个男生做partner和她同坐。但是,每个女孩都有各自的想法,举个例子把, Rabbit只愿意和XHD或PQK做partner,Grass只愿意和linle或LL做partner, PrincessSn原创 2014-07-16 09:05:45 · 334 阅读 · 0 评论