POJ 1160 Post Office
| Time Limit: 1000MS |
|
Memory Limit: 10000K |
| Total Submissions: 10151 |
|
Accepted: 5466 |
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
我的代碼 ：
簡單的 DP，未使用四邊形不等式優化 ：
#include <stdio.h>
#include <string.h>
#define N 309
#define M 39
int n, m, x[ N ];
int solve() {
int i, j, k, f[ N ][ M ], w[ N ][ N ], tmp;
int OO = 0x3f3f3f3f;
int t[ N ];
t[ 0 ] = 0;
for ( i = 1; i <= n; ++i ) {
t[ i ] = t[ i - 1 ] + x[ i ];
}
for ( i = 1; i <= n; ++i ) {
w[ i ][ i ] = 0;
for ( j = i + 1; j <= n; ++j ) {
k = ( j - i ) / 2 + i;
w[ i ][ j ] = t[ j ] - t[ k ] - t[ k - 1 ] + t[ i - 1 ] + x[ k ] * ( k + k - i - j );
}
}
memset( f, 0x3f, sizeof(f) );
f[ 0 ][ 0 ] = 0;
for ( i = 1; i <= n; ++i ) {
for ( j = 1; j <= m; ++j ) {
for ( k = 0; k < i; ++k ) {
if ( f[ k ][ j - 1 ] != OO ) {
tmp = f[ k ][ j - 1 ] + w[ k + 1 ][ i ];
if ( tmp < f[ i ][ j ] ) {
f[ i ][ j ] = tmp;
}
}
}
}
}
return f[ n ][ m ];
}
int main() {
int i;
scanf( "%d%d", &n, &m );
for ( i = 1; i <= n; ++i ) {
scanf( "%d", x + i );
}
printf( "%d\n", solve() );
return 0;
}