poj1160 Post Office

http://www.elijahqi.win/2018/01/12/poj1160-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
已经快要wc了 然而我还在补基础qwq 菜死呢 当年基础学的不是很好的
虽然似乎很多大佬的blog(譬如icefox巨佬的blog orz
的标签都给的是区间dp 然而我还是领悟不到精髓 还是喜欢套用leoly的dp方程 来搞首先预处理下dis[i][j]表示区间i~j只建一个邮局的最下花费是多少 可以类似dp转移dis[i][j]=dis[i][j-1]+a[j]-a[i+j>>1] 这样 为什么呢首先考虑我只有i~j的话 那么我一定是建在最中间最好 但为什么直接可以加 就是因为i~j-1那一块可以看成像一个滑块一样 往中间移动一下也不影响距离的总和
然后就是dp[i][k]表示前1~i个位置中我放了k个邮局的最小代价是多少 然后o(n^2*m)枚举转移下即可

#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 330
using namespace std;
inline char gc(){
    static char now[1<<16],*S,*T;
    if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0;char ch=gc();
    while(ch<'0'||ch>'9') ch=gc();
    while(ch<='9'&&ch>='0')x=x*10+ch-'0',ch=gc();
    return x;
}
int a[N],n,m,dp[N][33],dis[N][N];
int main(){
    freopen("poj1160.in","r",stdin);
    n=read();m=read();memset(dp,0x3f,sizeof(dp));
    for (int i=1;i<=n;++i) a[i]=read();
    for (int i=1;i<=n;++i) {
        for (int j=i+1;j<=n;++j) dis[i][j]=dis[i][j-1]+a[j]-a[(i+j)>>1];
    }for (int i=2;i<=n;++i) dp[i][1]=dis[1][i];//printf("%d\n",dis[1][i]);
    for (int k=2;k<=m;++k){
        for (int i=k+1;i<=n;++i){
            for (int j=1;j<i;++j) dp[i][k]=min(dp[i][k],dp[j][k-1]+dis[j+1][i]);
        }
    }printf("%d",dp[n][m]);
    return 0;
}