hdu-1227 Fast Food DP

题目链接

在n个商店中建m个仓库，使各个商店到仓库的路程之和最小，商店到哪个仓库是有选择的，总之路程之和要最小！

dp[i][j] = min ( dp[i-1][k] , dis[k+1][j])(i – 1<= k < j);表示在前k个餐馆建i-1个仓库的前提下，把第i的仓库建在k+1 到j 的餐馆之间

转移方程想不出来 还是看题解的

#include <stdio.h>
#include <string.h>
#include<functional>
#include <queue>
#include <algorithm>
using namespace std;
const int maxn = 205;
const int inf = 1<<30;
typedef __int64 LL;
int n,m;
int pos[maxn],dis[maxn][maxn],dp[35][maxn];//dp[i][j]代表前j个商店建i个仓库的最小距离.
void GetDp()
{
	int mid;
	for( int i = 1; i <= n; i ++ ){
		for( int j = i; j <= n; j ++ ){
			dis[i][j] = 0;
			mid = (i+j)>>1;
			for( int k = i; k <= j; k ++ )
				dis[i][j] += abs( pos[k] - pos[mid] );
		}
	}
	for( int i = 1; i <= n; i ++ )
		dp[1][i] = dis[1][i];
	for( int i = 2; i <= m; i ++ ){
		for( int j = i; j <= n; j ++ ){
			dp[i][j] = inf;
			for( int k = i-1; k <= j-1; k ++ ){
				dp[i][j] = min( dp[i-1][k] + dis[k+1][j],dp[i][j] );
			}
		}
	}
}
int main()
{
	#ifndef ONLINE_JUDGE  
	freopen("data.txt","r",stdin);  
	#endif  
	int cas = 1;
	while( scanf("%d%d",&n,&m) != EOF,(n||m) )
	{
		for( int i = 1; i <= n; i ++ )
			scanf("%d",&pos[i]);
		GetDp();
		printf("Chain %d\nTotal distance sum = %d\n\n",cas++,dp[m][n]);
	}
	return 0;
}