POJ 2112 Optimal Milking（最大流+二分枚举答案）

最新推荐文章于 2020-04-21 15:32:33 发布

Levi——

最新推荐文章于 2020-04-21 15:32:33 发布

阅读量212

点赞数

分类专栏：网络流

本文链接：https://blog.csdn.net/qq_41874469/article/details/81359270

版权

博客讲述了如何使用最大流算法和二分枚举方法解决一个有趣的优化问题：在有限的挤奶机和每个挤奶机最大处理牛的数量限制下，如何安排每头牛到挤奶机的路径，以使行走最远的牛距离最小。通过建立超级源点和超级汇点的网络流模型，确保所有牛都能被挤奶，并通过二分枚举找到最优解。

摘要由CSDN通过智能技术生成

Description

FJ has moved his K (1 <= K <= 30) milking machines out into the cow pastures among the C (1 <= C <= 200) cows. A set of paths of various lengths runs among the cows and the milking machines. The milking machine locations are named by ID numbers 1..K; the cow locations are named by ID numbers K+1..K+C.

Each milking point can "process" at most M (1 <= M <= 15) cows each day.

Write a program to find an assignment for each cow to some milking machine so that the distance the furthest-walking cow travels is minimized (and, of course, the milking machines are not overutilized). At least one legal assignment is possible for all input data sets. Cows can traverse several paths on the way to their milking machine.

Input

* Line 1: A single line with three space-separated integers: K, C, and M.

* Lines 2.. ...: Each of these K+C lines of K+C space-separa