最大流分支_最小费用最大流
2997ms
这个作者很懒,什么都没留下…
展开
-
POJ 2195:Going Home
Going Home Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 20223 Accepted: 10257 Description On a grid map there are n little men and n houses. In each u原创 2015-12-08 21:00:22 · 292 阅读 · 0 评论 -
POJ 2135:Farm Tour 邻接表最小费用最大流
Farm Tour Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 13824 Accepted: 5253 Description When FJ's friends visit him on the farm, he likes to show them原创 2015-12-15 21:05:15 · 418 阅读 · 0 评论 -
POJ 3422:Kaka's Matrix Travels
Kaka's Matrix Travels Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8882 Accepted: 3557 Description On an N × N chessboard with a non-negative number i原创 2015-12-16 17:06:57 · 545 阅读 · 0 评论