图论——二分图的匹配
# 图论——二分图的匹配
pxlsdz
冲就完了!
展开
-
hdu1179Ollivanders: Makers of Fine Wands since 382 BC. (二分最大匹配)
Time Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 1179DescriptionIn Diagon Alley ,there is only one Wand-seller,peeling gold letters...原创 2019-03-12 22:18:46 · 201 阅读 · 0 评论 -
二分匹配
原理介绍:http://www.renfei.org/blog/bipartite-matching.html(这篇好:二分图的最大匹配、完美匹配和匈牙利算法)https://blog.csdn.net/u013480600/article/details/45000541(题多)二分图最大匹配的模板//二分图最大匹配模板,二分图都是无向图//调用下面算法前,保证本图是二分...原创 2019-03-12 22:21:04 · 153 阅读 · 0 评论 -
POJ 1466 Girls and Boys(二分图最大独立集)
Girls and Boys Time Limit:5000MS Memory Limit:10000K Total Submissions:13903 Accepted:6203 Description In the second year of the university somebo...原创 2019-03-13 00:01:02 · 219 阅读 · 0 评论 -
POJ 1325 Machine Schedule(最小覆盖数)
Machine ScheduleTime Limit:1000MS Memory Limit:10000K Total Submissions:17649 Accepted:7385 DescriptionAs we all know, machine scheduling is a very classical problem in com...原创 2019-03-13 00:21:17 · 184 阅读 · 0 评论 -
POJ - 1419 Graph Coloring(最大团+输出路径模板)
Graph ColoringPOJ - 1419You are to write a program that tries to find an optimal coloring for a given graph. Colors are applied to the nodes of the graph and the only available colors are black ...原创 2019-03-13 11:02:04 · 194 阅读 · 0 评论 -
HDU 2119 Matrix(二分图最小点覆盖)
MatrixTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3543Accepted Submission(s): 1657Problem DescriptionGive you a matrix(only con...原创 2019-03-13 12:49:45 · 196 阅读 · 0 评论 -
HDU 1498 50 years, 50 colors (二分图最小点覆盖)
50 years, 50 colorsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3303Accepted Submission(s): 1851Problem DescriptionOn Octorber 2...原创 2019-03-13 17:32:50 · 203 阅读 · 0 评论