随笔分类 -  图论 匹配

hdu 3861 The King’s Problem trajan缩点+二分图匹配
摘要：The King’s Problem Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem Description In the Kingdom of Silence, the 阅读全文
posted @ 2017-07-02 19:33 jhz033 阅读(231) 评论(0) 推荐(0)
hdu 3829 Cat VS Dog 二分图匹配 最大点独立集
摘要：Cat VS Dog Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others) Problem Description The zoo have N cats and M dogs, today 阅读全文
posted @ 2017-06-03 10:22 jhz033 阅读(251) 评论(0) 推荐(0)
hdu 2444 The Accomodation of Students 判断二分图+二分匹配
摘要：The Accomodation of Students Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description There are a group of 阅读全文
posted @ 2017-02-18 13:14 jhz033 阅读(194) 评论(0) 推荐(0)
hdu 1498 50 years, 50 colors 最小点覆盖
摘要：50 years, 50 colors Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description On Octorber 21st, HDU 50-year 阅读全文
posted @ 2017-02-18 12:30 jhz033 阅读(240) 评论(0) 推荐(0)
关于匹配的一些问题
摘要：找出一个最大的集合使得该集合的任意两个人木有关系。 根据最大独立集 =顶点数 - 最大匹配数 hdu 1068 二分图的最小顶点覆盖数=最大匹配数 hdu 1150 DAG图（无回路有向图）的最小路径覆盖 hdu1151 阅读全文
posted @ 2017-02-17 19:04 jhz033 阅读(141) 评论(0) 推荐(0)