Divan计划在坐标线上建造n+1座不同建筑物，要求坐标为整数且不重叠。Divan从建筑i到建筑j会花费|xi-xj|分钟。目标是选择建筑物的位置，在未来十年内使Divan的步行时间最小。题目提供输入包含建筑访问次数，需要输出最小步行时间和每个建筑的位置。
The company "Divan's Sofas" is planning to build n+1 different buildings on a coordinate line so that:
- the coordinate of each building is an integer number;
- no two buildings stand at the same point.
Let xixi be the coordinate of the i-th building. To get from the building i to the building j, Divan spends |xi−xj| minutes, where |y| is the absolute value of y.
All buildings that Divan is going to build can be numbered from 0 to nn. The businessman will live in the building 0, the new headquarters of "Divan's Sofas". In the first ten years after construction Divan will visit the ii-th building aiai times, each time spending 2⋅|x0−xi| minutes for walking.
Divan asks you to choose the coordinates for all n+1 buildings so that over the next ten years the b
最低0.47元/天 解锁文章
609
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
