dp问题之fast food

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
using namespace std;
int a[300];
const int inf=0x3f3f3f3f;
int dp[35][210];
int Min(int x,int y){
 return x>y?y:x;
}
int fabs(int x){
 return x>0?x:(-x);
}
int cost(int i,int j){
 int ans=0;
 int mid=a[(i+j)/2];
 for(int k=i;k<=j;k++)
  ans+=fabs(a[k]-mid);
 return ans;
}
int main(){
 int n,m;
 int len=1;
 while(cin>>n>>m&&(n+m)){
  for(int i=1;i<=n;i++)
  scanf("%d",&a[i]);
  sort(a+1,a+n+1);
  //if(len>=2)
  //cout<<endl;
  memset(dp,inf,sizeof(dp));
  for(int i=1;i<=n;i++)
  dp[1][i]=cost(1,i);
  for(int i=2;i<=m;i++)
      for(int j=1;j<=n;j++)
      {
       for(int k=i-1;k<=j-1;k++)
       dp[i][j]=Min(dp[i][j],dp[i-1][k]+cost(k+1,j));
      }
      cout<<"Chain "<<len<<endl;
      len++;
  cout<<"Total distance sum"<<" "<<"="<<" "<<dp[m][n]<<endl;
         cout<<endl;
 }
} 

转移方程本质在求第i-1个仓库已知的情况下求第i个仓库放在哪里使得结果最小，类似递归思想，至少第一个仓库必须知道，即初始状态必须已知，dp[1][j]就是初始只放一个仓库的最小值，这就转变成求一堆递增序列所有点到其中一点的最短距离，该点就是中位数，所以初始化时就是求第1个商店到第j个商店的值；

http://acm.hdu.edu.cn/showproblem.php?pid=1227)
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 Input6 3
5
6
12
19
20
27
0 0
Sample OutputChain 1
Total distance sum = 8