[动态规划]Pku1160--Post Office

http://acm.pku.edu.cn/JudgeOnline/problem?id=1160

 

Post Office

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 7581		Accepted: 4018

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个上建立邮局，使得所有点到离它最近的邮局的距离最小。

 

分析：对于最优化问题，首选的算法是dp。分析题目不难得出经典状态：令f[i,j]表示前i个点上建立j个邮局的最小距离和。现在关键是状态转移。

这题是经典的剖分型dp。考虑在f[i,j-1]的基础上，再建一个邮局。若建在k处，则得到的解为f[k-1,j-1]+cost[k,i]。这里，cost[k,j]表示，在k..j之间建一个邮局的最小距离和，可以事先预处理得到。只建一个邮局的话，建在中点无疑是最好的。这样，就得到了状态转移方程：

f[i,j]:=min(f[k-1,j]+cost[k,i])。(j<=k<=i)。

时间复杂度为O(MN^2)。可以优化，利用四边形不等式，不过我不会= =

对于这题的数据规模，这个算法已经可以秒杀了。

codes：

 

var n,m:longint; f:array[0..300,0..30] of longint; a:array[1..300] of longint; cost:array[0..300,0..300] of longint; procedure init; var i,j,k:longint; begin readln(n,m); for i:=1 to n do read(a[i]); for i:=1 to n do for j:=i+1 to n do cost[i,j]:=cost[i,j-1]+a[j]-a[(i+j) div 2]; end; procedure dp; var i,j,k:longint; begin for i:=1 to n do begin f[i,1]:=cost[1,i]; f[i,i]:=0; end; for i:=2 to n do for j:=2 to m do if j>i then break else begin f[i,j]:=maxlongint div 10; for k:=j to i do if f[k-1,j-1]+cost[k,i]<f[i,j] then f[i,j]:=f[k-1,j-1]+cost[k,i]; end; writeln(f[n,m]); end; begin init; dp; end.