网络流
蒟蒻的ACMer
2014界大学新生
展开
-
POJ2516-Minimum Cost 最小费用最大流
H - Minimum Cost Time Limit:4000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Description Dearboy, a goods victualer, now comes to a big problem, and he原创 2015-11-29 08:56:16 · 651 阅读 · 0 评论 -
POJ 1459 Power Network DINIC
G - Power Network Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Description A power network consists of nodes (power stations, consumers原创 2015-11-24 12:41:42 · 536 阅读 · 0 评论 -
POJ 3308 Paratroopers 最小点权覆盖Dinic
F - Paratroopers Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Description It is year 2500 A.D. and there is a terrible war between the f原创 2015-11-20 23:28:21 · 578 阅读 · 0 评论