zju1196-Fast Food

#include<iostream>
using namespace std;


int i, j, m;
int *d;//沿高速公路n个快餐店的位置
int n, k;//饭店的数量，仓库的数量
int cost[202][202];
int dis[205][205];
int temp;


void madecost()//计算数组cost[][]：在任意两个饭店中间建一个仓库时，该两个饭店之间的所有饭店与该仓库的距离和
{
    for (i = 1; i <= n; i++)
    {
        for (j = 1; j <= n; j++)
        {
            temp = (i + j) / 2;
            cost[i][j] = 0;
            for (m = i; m <= j; m++)
                cost[i][j] += abs(d[m] - d[temp]);
        }
    }
}


void DP()//动态规划
{
    memset(dis, 1, sizeof(dis));
    for (i = 1; i <= n; i++)
        dis[1][i] = cost[1][i];
    for(i=2;i<=k;i++)
        for (j = i; j <= n; j++)
            for (m = i - 1; m < j; m++)
            {
                temp = dis[i - 1][m] + cost[m + 1][j];
                if (temp < dis[i][j])
                    dis[i][j] = temp;
            }
    
}


void main()
{
    cin >> n >> k;
    d = new int[n+1];
    for (int x = 1; x <= n; x++)
        cin >> d[x];
    madecost();
    DP();
    cout << "Total distance sum=" << dis[k][n] << endl;


}