# 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.

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.

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

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.

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

Sample Output
Chain 1 Total distance sum = 8

一个快餐公司拥有n个快餐店在同一条高速公路上，公司总部也在高速公路上，给定di0<i<=n）表示第i个店到公司总部的距离，并且d1<d2<d3<…..现在要建立k个原材料储存站，给这n个快餐店供应原材料。

每个快餐店的供货储存站是具体它最近的那个存储站，要求所有的快餐店到其供货的储存站的路径的和最短。求最短路径数。

dp[k][n]

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

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

虽然这些过程中会违反“某个快餐店没有得到距离它最近的存储站的供货”，但是违反了这一性质的必定不是最短的距离，那么也就保持了结果的正确性。

中位数的性质：求x轴上n个点，那么找一个点到其它点的距离和最小，那么这个点必定是中位数。

#### DesktopReminderSetup

2010年12月27日 19.5MB 下载

#### HDU图论题目分类

2013年04月18日 211KB 下载

#### 动态规划背包问题入门

2011年07月07日 328KB 下载

#### food_info.csv

2017年11月16日 1.45MB 下载

#### 背包问题模板 hdu2191

2014年06月24日 12KB 下载

#### HDU 递归题详解大全（含代码）

2011年03月31日 113KB 下载

2009年10月04日 93KB 下载

#### HDU DP动态规划

2010年03月31日 454KB 下载

#### 2017hdu多校联合训练第一场标程及数据

2017年07月26日 36.69MB 下载

#### ACM HDU 2000-2099 解题报告 杭电　ACM

2009年06月16日 806KB 下载