杭电1227 DP

Fast Food

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2810    Accepted Submission(s): 1206

Problem Description

The fastfood chain McBurger owns several restaurants along a highway. Recently, they have decided to build several depots along the highway, each one located at a restaurant and supplying several of the restaurants with the needed ingredients. Naturally, these depots should be placed so that the average distance between a restaurant and its assigned depot is minimized. You are to write a program that computes the optimal positions and assignments of the depots.

To make this more precise, the management of McBurger has issued the following specification: You will be given the positions of n restaurants along the highway as n integers d1 < d2 < ... < dn (these are the distances measured from the company's headquarter, which happens to be at the same highway). Furthermore, a number k (k <= n) will be given, the number of depots to be built.

The k depots will be built at the locations of k different restaurants. Each restaurant will be assigned to the closest depot, from which it will then receive its supplies. To minimize shipping costs, the total distance sum, defined as



must be as small as possible.

Write a program that computes the positions of the k depots, such that the total distance sum is minimized.

 

Input

The input file contains several descriptions of fastfood chains. Each description starts with a line containing the two integers n and k. n and k will satisfy 1 <= n <= 200, 1 <= k <= 30, k <= n. Following this will n lines containing one integer each, giving the positions di of the restaurants, ordered increasingly.

The input file will end with a case starting with n = k = 0. This case should not be processed.

 

Output

For each chain, first output the number of the chain. Then output a line containing the total distance sum.

Output a blank line after each test case.

 

Sample Input

  
  

   
   6 3
5
6
12
19
20
27
0 0
  
  

 

Sample Output

  
  

   
   Chain 1
Total distance sum = 8
  
  

  
题意：公路上有一排（n个）餐馆，给出各餐馆的坐标，然后要建立一些（k个）仓库，仓库必须建立在餐馆的坐标上，问怎么建立才能使所有餐馆到仓库的距离和最小。
思路：这道DP还是比较难想的，才看了大牛的题解后才有了思路。用dp[ i ][ j ]表示前 i 个餐馆中建立 j 个仓库的最短距离和；用dis[ i ][ j ]表示在第 i 个和第 j 个餐馆间建立一个仓库所增加的距离。
首先第一步是计算dis[ i ][ j ]的值，若要保证距离最短，则仓库应建在 i 和 j 的中间位置，因而 dis[ i ][ j ]+=abs( a [ ( i + j ) / 2 ] - a [ k ] )（k : i -> j）；
第二步则是找状态转移方程计算dp[ i ][ j ]的值了。则有dp[ i ][ j ]=min(dp[ i ][ j ],dp[ i-1 ][ m ]+dis[ m+1 ][ j ])（m:i-1—>j-1）。

AC代码：

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
#define LL long long
#define M(x,y) memset(x,y,sizeof(x))
#define INF 0xFFFFFF
using namespace std;
int n,k,a[205],dp[205][205],dis[205][205],t=0;
int main()
{
    //freopen("D://in.txt", "r", stdin);
    while(~scanf("%d %d",&n,&k))
    {
        if(n==0&&k==0)
            break;
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
        for(int i=1;i<=n;i++)
            for(int j=i;j<=n;j++)
            {
                dis[i][j]=0;
                for(int k=i;k<=j;k++)
                    dis[i][j]+=abs(a[(i+j)/2]-a[k]);
            }
        for(int i=1;i<=n;i++)
            dp[1][i]=dis[1][i];
        for(int i=2;i<=k;i++)
            for(int j=i;j<=n;j++)
            {
                dp[i][j]=INF;
                for(int m=i-1;m<j;m++)
                    dp[i][j]=min(dp[i][j],dp[i-1][m]+dis[m+1][j]);
            }
        printf("Chain %d\nTotal distance sum = %d\n\n",++t,dp[k][n]);
    }
    return 0;
}