网络流
关注
分享
扫一扫
蒟蒻的ACMer
2014界大学新生
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
POJ2516-Minimum Cost 最小费用最大流
H - Minimum CostTime Limit:4000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionDearboy, a goods victualer, now comes to a big problem, and he原创 2015-11-29 08:56:16 · 683 阅读 · 0 评论 -
POJ 1459 Power Network DINIC
G - Power NetworkTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionA power network consists of nodes (power stations, consumers原创 2015-11-24 12:41:42 · 562 阅读 · 0 评论 -
POJ 3308 Paratroopers 最小点权覆盖Dinic
F - ParatroopersTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionIt is year 2500 A.D. and there is a terrible war between the f原创 2015-11-20 23:28:21 · 604 阅读 · 0 评论