![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
二分匹配法
昨日明眸
个人爱好
展开
-
二分图最大匹配(匈牙利算法)
二分图最大匹配(匈牙利算法) (1)前提说明:(用到的定义说明) 1。二部图: 如果图G=(V,E)的顶点集何V可分为两个集合X,Y,且满足 X∪Y = V, X∩Y=Φ,则G称为二部图;图G的边集用E(G)表示,点集用V(G)表示。 2。匹配: 设M是E(G)的一个子集,如果M中任意两条边在G中均不邻接,则称M是G的一个匹配。M中的—条边的两个端点叫做在转载 2016-07-22 21:29:40 · 617 阅读 · 0 评论 -
hdu2063过山车(二分匹配)
过山车 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 18735 Accepted Submission(s): 8174 Problem Description RPG girls今天和大家一起去游乐场玩,终于可原创 2016-08-16 19:44:27 · 262 阅读 · 0 评论 -
hdu1179Ollivanders: Makers of Fine Wands since 382 BC.(二分匹配)
Ollivanders: Makers of Fine Wands since 382 BC. Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others) Total Submission(s): 1485 Accepted Submission(s): 823 Pro原创 2016-08-16 19:59:05 · 225 阅读 · 0 评论 -
Contest - 多校训练(三
Contest - 多校训练(三) Problem E: G Time Limit: 1 Sec Memory Limit: 128 MB Submit: 329 Solved: 70 SubmitStatusWeb Board Description 晴天也来寻宝啦,有一个m层的宝塔,只能从第一层开始一层一层的往上走,每层都有一个门,你需要用钥匙来打开原创 2016-08-17 17:03:54 · 270 阅读 · 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 <= N <= 500). The grid contains K asteroids (1 <= K <= 10,000), which are conven原创 2016-10-30 16:08:00 · 289 阅读 · 0 评论