2016年6月27日
POJ 2195 Going Home (最小费用最大流)
摘要： Going Home Time Limit: 1000MS Memory Limit: 65536K Time Limit: 1000MS Memory Limit: 65536K Description On a grid map there are n little men and n hous 阅读全文
posted @ 2016-06-27 17:07 季末Despair 阅读(158) 评论(0) 推荐(0) 编辑
HDU 2732 Leapin' Lizards (最大流)
摘要： Leapin' Lizards Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Description Your platoon of wandering lizards has ent 阅读全文
posted @ 2016-06-27 17:05 季末Despair 阅读(204) 评论(0) 推荐(0) 编辑
POJ 2516 Minimum Cost (最小费用最大流)
摘要： Minimum Cost Time Limit: 4000MS Memory Limit: 65536K Description Dearboy, a goods victualer, now comes to a big problem, and he needs your help. In hi 阅读全文
posted @ 2016-06-27 16:57 季末Despair 阅读(178) 评论(0) 推荐(0) 编辑