HDU 1227 Fast Food

 

Fast Food

 

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个快餐店在同一条高速公路上，公司总部也在高速公路上，给定di（0<i<=n）表示第i个店到公司总部的距离，并且d1<d2<d3<…..现在要建立k个原材料储存站，给这n个快餐店供应原材料。


   
   
         每个快餐店的供货储存站是具体它最近的那个存储站，要求所有的快餐店到其供货的储存站的路径的和最短。求最短路径数。


   
   
 


   
   
解题思路：


   
   
         dp[k][n]


   
   
         dp[
i ] [ j ]表示前i个储存站供应前j个快餐店的最短距离。


   
   
         dp
[ i ] [ j ]=min { dp[ i-1 ][ k ]+在k到j直接选择一个储存站的最小距离 }，k=i+1,i+2,..j-1.


   
   
         虽然这些过程中会违反“某个快餐店没有得到距离它最近的存储站的供货”，但是违反了这一性质的必定不是最短的距离，那么也就保持了结果的正确性。


   
   
         中位数的性质：求x轴上n个点，那么找一个点到其它点的距离和最小，那么这个点必定是中位数。#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<cstdlib>
using namespace std;
const int N=205,K=35;
const int oo=1<<30;
int f[N],dp[K][N];

int cal(int l,int r)
{
	int tmp=0;
	while(r-l>0)
	{
		tmp+=f[r]-f[l];
		r--;
		l++;
	}
	return tmp;
}

int main()
{
//	freopen("1.txt","r",stdin);
	int n,k,cases=0;
	while(scanf("%d %d",&n,&k)!=EOF&&(n||k))
	{
		cases++;
		for(int i=1;i<=k;i++)
			for(int j=0;j<=n;j++)
				dp[i][j]=oo;
		for(int i=1;i<=n;i++)
			cin>>f[i];
		for(int i=1;i<=n;i++)
			dp[1][i]=cal(1,i);
		for(int i=2;i<=k;i++)
			for(int j=i;j<=n;j++)
				for(int k=i-1;k<j;k++)
				{
					int t=dp[i-1][k]+cal(k+1,j);
					if(dp[i][j]>t)
						dp[i][j]=t;
				}
		printf("Chain %d/n",cases);
		printf("Total distance sum = %d/n/n",dp[k][n]);
	}
	return 0;
}