HDU 1227 Fast Food

我只想说这题有点烦。

用dp[i][j]来表示前j个商店建i个仓库的最小距离，则dp[i][j] = min(dp[i-1][l]+cost[l+1][j]) (1<=l<j);cos[x][y]表示的是在x到y之间建一个仓库的距离，此仓库必然是建在下标为（x+y）/2的位置。 

#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <algorithm>
#include <map>
#include <vector>
#include <stack>
using namespace std;
#define M 1005
#define ll long long
#define int64 __int64

int n , k , arr[205] , dp[35][205] , cost[205][205];

void Init()
{
    int i , j , l;
    memset(cost , 0 , sizeof cost);
    for (i = 1 ; i <= n ; i++)
    {
        for (j = i ; j <= n; j++)
        {
            int x = (i+j)>>1;
            for (l = i ; l <= j ; l++)
            {
                cost[i][j] += abs(arr[x]-arr[l]);
            }
        }
    }
}

int Solve()
{
    int i , j , l;
    for (i = 0 ; i <= k ; i++)dp[i][i] = 0;
    for (i = 1 ; i <= n ; i++)dp[1][i] = cost[1][i];
    for (i = 2 ; i <= k ; i++)
    {
        for (j = i+1 ; j <= n ; j++)
        {
            int MIN = 1<<30;
            for (l = i-1 ; l < j ; l++)
            {
                MIN = min(dp[i-1][l]+cost[l+1][j],MIN);
            }
            dp[i][j] = MIN;
        }
    }
    return dp[k][n];
}

int main()
{
    int tcase = 1;
    while (scanf("%d%d",&n,&k) , n)
    {
        int i;
        for (i = 1 ; i <= n ; i++)scanf("%d",arr+i);
        Init();
        printf("Chain %d\n",tcase++);
        printf("Total distance sum = %d\n\n",Solve());
    }
    return 0;
}