图论练习
文章平均质量分 87
Bamb00D
这个作者很懒,什么都没留下…
展开
-
POJ 1149 PIGS(最大流)
PIGS Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u Submit Status Description Mirko works on a pig farm that consists of M locked pig-houses and Mirko can原创 2015-08-03 20:26:02 · 403 阅读 · 0 评论 -
HDU 1532 Drainage Ditches(最大流)
Drainage Ditches Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u Submit Status Description Every time it rains on Farmer John's fields, a pond forms over原创 2015-08-03 20:19:30 · 350 阅读 · 0 评论 -
HDU 1150 Machine Schedule(最小点覆盖)
Description As we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling problems differ widely in the nature of t原创 2015-08-01 10:37:48 · 451 阅读 · 0 评论 -
HDU 1158 Segment set(线段相交 并查集)
Description A segment and all segments which are connected with it compose a segment set. The size of a segment set is the number of segments in it. The problem is to find the size of some segment原创 2015-07-31 16:22:27 · 426 阅读 · 0 评论