求大神帮我翻一下下面的文章，拜托！

2025-02-15 10:58:33

推荐回答（1个）

回答1：

The fastfood chain McBurger owns several restaurants along a highway. Recently, they have decided to build several depots along the highway, each one located at a restaurant and supplying several of the restaurants with the needed ingredients. Naturally, these depots should be placed so that the average distance between a restaurant and its assigned depot is minimized. You are to write a program that computes the optimal positions and assignments of the depots.
快餐连锁店mcburger拥有沿公路的几家餐馆。最近，他们已经决定沿公路建设若干段，每一个位于一家餐厅，提供一些所需要的成分的餐馆。当然，这些仓库应放在这样一个餐厅和分配站之间的平均距离最小化。你要写一个程序计算的最佳位置和仓库作业。
To make this more precise, the management of McBurger has issued the following specification: You will be given the positions of n restaurants along the highway as n integers d1 < d2 < ... < dn (these are the distances measured from the company's headquarter, which happens to be at the same highway). Furthermore, a number k (k <= n) will be given, the number of depots to be built.
为了使其更精确，对mcburger管理具有以下规格发布：你会给出N个餐馆沿公路的位置为n D1 D2 < <…< DN（这些都是从公司总部，这恰好是在同一公路测量的距离）。此外，一个数k（k≤n）将被给定的，是建立车辆数。
The k depots will be built at the locations of k different restaurants. Each restaurant will be assigned to the closest depot, from which it will then receive its supplies. To minimize shipping costs, the total distance sum, defined asmust be as small as possible.
K站将建在不同的K餐厅的位置。每个餐厅将被分配到最近的车站，它将接收到的供应。为了减少运输成本，总距离，定义asmust尽可能小。
Write a program that computes the positions of the k depots, such that the total distance sum is minimized.
写一个程序计算的K站的位置，这样总的距离的总和最小化。
Input
输入
The input file contains several descriptions of fastfood chains. Each description starts with a line containing the two integers n and k. n and k will satisfy 1 <= n <= 200, 1 <= k <= 30, k <= n. Following this will n lines containing one integer each, giving the positions di of the restaurants, ordered increasingly.
输入文件包含几个描述的快餐连锁店。每个描述的第一行包含两个整数N和K的N和K将满足1≤n≤200，1≤k≤30≤N，K以下N行包含每一个将整数，给出位置迪的餐馆，点越来越。
The input file will end with a case starting with n = k = 0. This case should not be processed.
输入文件将结束一个案例从n = K = 0。这不能被处理。
Output
输出
For each chain, first output the number of the chain. Then output a line containing the total distance sum.
每个链，第一输出外链的数量。然后输出的总距离和线。
Output a blank line after each test case.
输出一个空白行，每个测试案例后。

最新问答

坦克世界可以不可以赠送银币车

梦到自己眼球掉出来。。

在洪雅怎么去瓦屋山，车次，时间，距离，车费，怎么样？

一个从来没有学习的人，怎么一边学习一边减肥，各方面提升自己

在面上加载用pressure加载与force加载有什么区别

肺癌中期有可能导致两侧肋骨陈旧性骨折吗?

男生说我很傻，傻得很可爱什么意思？

三星s4怎么进入recovery

为什么安卓4.3也不能读写外置sd卡?怎么办

房价上涨卖方违约怎么办