费用流
Viscu
勤能补拙。
展开
-
POJ2195 Going Home(spfa费用流+链式前向星)
Going Home Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 22091 Accepted: 11156 DescriptionOn a grid map there are n little men and n houses. In each unit time, every little man原创 2016-12-05 16:45:19 · 393 阅读 · 0 评论 -
HDU3667 Transportation(spfa费用流+拆边)
TransportationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2871 Accepted Submission(s): 1225 Problem Description There are N cities, and M原创 2016-12-08 17:53:07 · 371 阅读 · 0 评论