Post Office
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 12560 | Accepted: 6765 |
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.
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
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <iostream>
using namespace std;
int x[310];
int sum[310][310]; //第i到第j个村庄里建1个邮局的最小距离
int ans[310][31]; //前i个村庄里建j个邮局的最小距离
int main(){
int v, p, i, j, k;
while (cin >> v >> p){
for(i = 1; i <= v; i ++){
scanf("%d", &x[i]);
}
memset(sum, 0, sizeof(sum));
memset(ans, 0, sizeof(ans));
for(i = 1; i < v; i ++) //不管i到j有奇偶个村,有一个很神奇得性质是从i到j建一个的最小距离,等于i到j+1时i到j的最小距离
for(j = i + 1; j < v + 1; j ++){
sum[i][j] = sum[i][j-1] + x[j] - x[(i + j) / 2];
if(1 == i)
ans[j][i] = sum[i][j];//边界条件,前j个村庄只有1个邮局
}
for(j = 2; j <= p; j ++) //表示邮局数,把它写在外面的原因是后面更新时ans[i][j]要用到ans[k][j-1](k < i)来表示,则邮局数少的要先算出来
for(i = j + 1; i <= v; i ++){//表示前多少个村庄
ans[i][j] = 9999999;
for(k = j - 1; k < i; k ++)//表示在k村庄处断开,从k+1到i村庄共用一个邮局
ans[i][j] = min(ans[i][j], ans[k][j - 1] + sum[k + 1][i]);
}
cout << ans[v][p] << endl;
}
return 0;
}