代码之路—— Fast Food

题目

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.

思路

1.如果已知从第i个商店到第j个商店中有一个仓库，则这个仓库位于中间，也就是中位数（i+j）/2，原因如下：
假设在5个商店中有一个仓库，则对于最远的2个商店，也就是第1个和第5个，无论仓库位于哪里，其路程和都是第1个仓库到第5个仓库的距离，此时可以不再讨论仓库对于这两个商店的影响，此时要讨论的商店仅剩3个，再依据上面的思路去讨论类似的问题，最后仅剩1个商店或2个商店，则仓库位于中位数处是距离和最小的。（反证即可）
2.依据上面的思路进行动态规划。dp[ i ][ j ]代表前j个商店有i个仓库，找到动态转移方程：

dp[ i ][ j ] = min( dp[ i ][ j ] , dp[ i-1 ][ m ] + cost[ m+1 ][ j ])

其中 i-1<=m<=j-1, 由于仓库数量确定为i-1，而商店数量未知，但可以确定他的取值范围。（第i-1个仓库在第i-1个商店）m=i-1,（第i个仓库在j处），则m=j-1。

代码

#include <stdio.h>
#include <stdlib.h>
#include <stdlib.h>
#define Max 10000
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
int dp[40][210];
int cost[210][210];
int dis[210];

int min(int x, int y){
	return x>y?y:x;
}

int main(int argc, char *argv[]) {
	int n, k, i ,j, count = 0;
	while(scanf("%d%d", &n, &k) == 2 && n != 0 && k != 0){
		count++;
		memset(dp, Max, sizeof(dp));
		memset(cost, 0, sizeof(cost));
		memset(dis, 0, sizeof(dis));
		for(i = 1; i <= n; i++){
			scanf("%d",dis + i);
		}
		for(i = 1; i <= n; i++){		//计算从第i个餐厅到第j个餐厅只有一个仓库距离的求和 
			for(j = i; j <= n; j++){
				for(int m = i; m <= j; m++){
					cost[i][j] += abs(dis[m]-dis[(i+j)/2]);
				}
			}
		}
		for(i = 1; i <= n ; i++){	//街上只有一个商店，此时距离和为cost 
			dp[1][i] = cost[1][i];
		}
		for(i = 2; i <= k; i++){		//i代表街上的仓库数量 
			for(j = i; j <= n; j++){		//j代表街上商店的数量，商店要大于等于仓库数量 
				for(int m = i-1; m <= j-1; m++){		//状态转移方程，从i-1个仓库去推，由于商店数量未知，但知道其范围为 i-1~j-1 
					dp[i][j] = min(dp[i][j],dp[i-1][m] + cost[m+1][j]);
				}
			}
		}
		printf("Chain %d\n",count);
		printf("Total distance sum = %d\n",dp[k][n]);
		printf("\n");
	}
}