![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
图论---二分匹配
文章平均质量分 88
yuanS7
编程菜鸟,求大神带飞
展开
-
hdu2444—The Accomodation of Students(二分图判定+最大匹配)
题目链接:传送门 The Accomodation of Students Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6608 Accepted Submission(s): 2964 Proble原创 2017-07-19 19:41:12 · 212 阅读 · 0 评论 -
hdu1498—50 years, 50 colors(最小点覆盖)
题目链接:传送门 50 years, 50 colors Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2650 Accepted Submission(s): 1509 Problem Descrip原创 2017-07-20 16:42:52 · 229 阅读 · 0 评论 -
hdu3729—I'm Telling the Truth(二分图最大匹配)
题目链接:传送门 I'm Telling the Truth Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2305 Accepted Submission(s): 1147 Problem Descr原创 2017-07-19 20:19:56 · 229 阅读 · 0 评论 -
LA7984—Delivering Goods(最短路+DAG上的最少路径覆盖)
题目链接:传送门 题目大意:给定n个点,m条有向边,c个需要被访问的点,c个点都要在最短的时间内被访问到。问一些卡车从0点出发,访问c个点,最少需要多少辆卡车。 解题思路:对于那c个点,若任意两个点间在同一个最一最短路径上,则在两个点间连边,这样将构成一个DAG。那么问题就变成了最少需要多少条路径才能覆盖该图上的所有点,即DAG上的最小路径覆盖问题。 白书上的解法:建原创 2017-08-29 21:30:02 · 335 阅读 · 3 评论 -
hdu2119—Matrix(最小点覆盖)
题目链接:传送门 Matrix Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3012 Accepted Submission(s): 1368 Problem Description Give原创 2017-07-20 16:03:05 · 228 阅读 · 0 评论 -
hdu1045—Fire Net(二分图最大匹配)
题目链接:传送门Fire NetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12228 Accepted Submission(s): 7379Problem DescriptionSuppose that we have a s...原创 2017-07-19 17:07:37 · 317 阅读 · 0 评论 -
hdu1150—Machine Schedule(二分图最大匹配)
题目链接:传送门 Machine Schedule Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9187 Accepted Submission(s): 4609 Problem Descriptio原创 2017-07-20 13:57:21 · 187 阅读 · 0 评论 -
hdu3605—Escape(二分图的多重匹配)
题目链接:传送门 Escape Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 10199 Accepted Submission(s): 2443 Problem Description 2012原创 2017-07-22 09:16:28 · 202 阅读 · 0 评论 -
hdu3081—Marriage Match II(并查集+最大匹配)
题目链接:传送门 Marriage Match II Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4051 Accepted Submission(s): 1326 Problem Descripti原创 2017-07-22 14:57:30 · 289 阅读 · 0 评论