二分图
Key_LD
垫底一本的寝室蹲
展开
-
HDU 2853 Assignment 建图的巧妙性
Description Last year a terrible earthquake attacked Sichuan province. About 300,000 PLA soldiers attended the rescue, also ALPCs. Our mission is to solve difficulty problems to optimization the assi原创 2016-08-12 15:38:04 · 343 阅读 · 0 评论 -
hdu1350 坐标建图后的最小路径覆盖
Taxi Cab Scheme Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1067 Accepted Submission(s): 533 Problem Description Running a tax原创 2016-08-08 23:03:04 · 379 阅读 · 0 评论 -
hdu 1045 二分匹配练习 重在转化啊!!
Fire Net Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10212 Accepted Submission(s): 5975 Problem Description Suppose that we have原创 2016-08-08 19:42:05 · 210 阅读 · 0 评论 -
hdu1498 大水题
Description On Octorber 21st, HDU 50-year-celebration, 50-color balloons floating around the campus, it's so nice, isn't it? To celebrate this meaningful day, the ACM team of HDU hold some fuuny ga原创 2016-08-07 18:35:31 · 524 阅读 · 5 评论 -
FZU2039 匈牙利算法
惯例来个简介 因为一开始看到这个算法的时候我也十分懵逼 匈牙利算法是由匈牙利数学家Edmonds于1965年提出,因而得名。匈牙利算法是基于Hall定理中充分性证明的思想,它是部图匹配最常见的算法,该算法的核心就是寻找增广路径,它是一种用增广路径求二分图最大匹配的算法。 其实说白了 这个算法用途有限 只能求二分图的最大匹配(如果没有任何扩展,毕竟我是鶸……原创 2016-07-26 21:45:22 · 295 阅读 · 0 评论