Post Office详解（动态规划）

Description

There is a straight highway with villages alongside the highway. The highway is represented as an integer axis, and the position of each village is identified with a single integer coordinate. There are no two villages in the same position. The distance between two positions is the absolute value of the difference of their integer coordinates.

Post offices will be built in some, but not necessarily all of the villages. A village and the post office in it have the same position. For building the post offices, their positions should be chosen so that the total sum of all distances between each village and its nearest post office is minimum.

You are to write a program which, given the positions of the villages and the number of post offices, computes the least possible sum of all distances between each village and its nearest post office.

Input

Your program is to read from standard input. The first line contains two integers: the first is the number of villages V, 1 <= V <= 300, and the second is the number of post offices P, 1 <= P <= 30, P <= V. The second line contains V integers in increasing order. These V integers are the positions of the villages. For each position X it holds that 1 <= X <= 10000.

Output

The first line contains one integer S, which is the sum of all distances between each village and its nearest post office.

Sample Input

10 5
1 2 3 6 7 9 11 22 44 50

Sample Output

9

Source
IOI 2000

题意：有n个村庄，m个邮局，并且有每一个村庄的位置坐标，如今要将m个邮局设立在这n个村庄里面，要使每一个村庄到最近的邮局的距离和最小，最小距离是多少。

解题思路：dp[i][j] 记录 i个邮局 j个村庄的最小花费，cost[k+1][j]。记录在k+1号村庄到 j 号村庄设立一个邮局的最小花费,重点是一个邮局。那么dp[i][j]=min （dp[i][k]+cost[k+1][j]，dp[i][j]） ，最后得到的dp[m][n]就是最小的花费，这里就是从一个到多个的递推，累计取最小。可是在k+1号村庄到 j 号村庄设立一个邮局的最小花费是多少呢？答案：中位数。设置在中间那个村庄就可以。我们可以想一下，当邮局在最中间的时候，两边的村庄到这个邮局的距离和最小。

代码：

#