HDU1227 Fast Food

最新推荐文章于 2020-03-06 09:30:00 发布

qhpeklh5959

最新推荐文章于 2020-03-06 09:30:00 发布

阅读量636

点赞数

分类专栏：动态规划

本文链接：https://blog.csdn.net/severus_qin/article/details/17070313

版权

动态规划专栏收录该内容

22 篇文章 0 订阅

订阅专栏

题目大意

题目链接

n个饭店，要建m个仓库，现在给所有饭店之间的距离，问m个仓库怎么建能建的最小？输出最小值

解题思路

比较经典的动态规划，dp[i][j]表示的是前i个饭店，建j个原料站的最小距离

状态转移方程是：dp[i][j] = min(dp[k][j - 1] + w[k, j])

其中w[i,k]表示第i个快餐店到k个快餐店之间均没有原料站，而且原料站位于i、k时，i~k个快餐店获取原料的距离之和。

AC代码

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 210;
const int INF = ~0u >> 1;
int w[maxn][maxn], dp[maxn][35], a[maxn];
int n, m;
int main(){
    int kase = 1; 
    while(scanf("%d%d", &n, &m) == 2 && n && m){
        memset(dp, 0, sizeof(dp));
        for (int i = 0; i < n; i++) scanf("%d", &a[i]);
        for (int i = n - 1; i >= 0; i--)
            a[i] = a[i] - a[0] + 1;
        for (int i = 0; i < n; i++)
            for (int j = i; j < n; j++){
                w[i][j] = 0;
                for (int k = i; k <= j; k++)
                    w[i][j] += min(a[k] - a[i], a[j] - a[k]);
            }
        for (int i = 0; i < n; i++)
            for (int j = 0; j <= i; j++)
                dp[i][1] += a[i] - a[j];
        for (int j = 2; j <= m; j++)
            for (int i = j - 1; i < n; i++){
                dp[i][j] = INF;
                for (int k = j - 2; k < i; k++)
                    dp[i][j] = min(dp[i][j], dp[k][j - 1] + w[k][i]);
            }
        printf("Chain %d\n", kase++);
        printf("Total distance sum = ");
        int ans = INF;
        for (int i = 0; i < n; i++){
            int s = 0;
            for (int j = i + 1; j < n; j++)
                s += a[j] - a[i];
            ans = min(ans, s + dp[i][m]);
        }
        printf("%d\n\n", ans);
    }
    return 0;
}