Fast Food
Time Limit:1s | Memory limit:32M |
Accepted Submit:327 | Total Submit:910 |
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.
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. 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 as
must be as small as possible.
Output a blank line after each test case.
6 3 5 6 12 19 20 27 0 0
Chain 1 Total distance sum = 8 |
http://acm.fzu.edu.cn/problem.php?pid=1005
经典的DP题,最难想的是构造数组ans[n][k],代表从1~n个站点之间修建k个食品供应站所得的最优解。
这样得到状态转移方程:
ans[n][k]=min{ans[t][k-1]+mid[t+1][n]};k-1<=t<n,k>1
ans[n][k]=mid[1][n];k=1;
其中mid[i][j]代表在第i个站点到第j个站点之间修建一个食品供应站的最短距离,这个食品供应站必定在中位点!