HDU 1227 Fast Food


Fast Food


Problem Description
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.

Write a program that computes the positions of the k depots, such that the total distance sum is minimized. 


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.

The input file will end with a case starting with n = k = 0. This case should not be processed. 


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.


Sample Input
6 3 5 6 12 19 20 27 0 0


Sample Output
Chain 1 Total distance sum = 8







         dp[ i ] [ j ]表示前i个储存站供应前j个快餐店的最短距离。

         dp [ i ] [ j ]=min { dp[ i-1 ][ k ]+kj直接选择一个储存站的最小距离 }k=i+1,i+2,..j-1.




个人分类: DP
上一篇HDU 1466 计算直线的交点数 dfs
下一篇HDU 1257 最少拦截系统
想对作者说点什么? 我来说一句


2010年12月27日 19.5MB 下载


2013年04月18日 211KB 下载


2011年07月07日 328KB 下载


2017年11月16日 1.45MB 下载

背包问题模板 hdu2191

2014年06月24日 12KB 下载

HDU 递归题详解大全(含代码)

2011年03月31日 113KB 下载

Facebook 餐城加速软体

2009年10月04日 93KB 下载

HDU DP动态规划

2010年03月31日 454KB 下载