本文介绍了罗马尼亚一家著名啤酒公司如何在城市间建设K家啤酒厂以最小化啤酒运输的最大成本。每个城市的需求量已知，城市通过树状道路网络连接。目标是找到最优的啤酒厂位置，使得从任何城市到最近啤酒厂的距离乘以其需求量的运输成本最小。题目给出了输入输出格式，并提供了一个样例输入输出及解释。
Problem Description
People drink a lot of beer in Romania. For each city i of the N cities of the country (numbered from 1 to N), the amount of beer Bi demanded by its inhabitants is known. In order to satisfy the overall demand, a famous beer company wishes to build K breweries in K distinct cities of Romania. From these breweries, beer will be transported to other cities using the existing road network. Each road connects two distinct cities and has a certain length. Because of the recent floods, the road network of Romania has the shape of a tree: that is, there is exactly one path between any pair of cities. Let’s condier a city i and a brewery located in a city X, which is the closest brewery to i. The cost of transportin
订阅专栏 解锁全文
扫一扫
37
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
