hdoj 1227 Fast Food 【dp】

原创 2015年11月19日 20:34:25


Fast Food

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2521    Accepted Submission(s): 1071


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个餐厅的位置,求修k个仓库到这n个餐厅的距离最小。
代码:
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<queue>
#include<stack>
#include<vector>
#define mem(x,y) memset(x,y,sizeof(x))
#define inf 0x3f3f3f3f
#define N 220
using namespace std;

int dis[N],dp[N][N],cost[N][N];

int main()
{
    int n,m;
    int cnt=0;
    while(scanf("%d%d",&n,&m)!=EOF,(n||m))
    {
        int i,j,k;
        mem(cost,0);
        mem(dp,inf);
        for(i=1;i<=n;i++)
            scanf("%d",&dis[i]);
        for(i=1;i<=n;i++)
            for(j=i;j<=n;j++)
            {
                for(k=i;k<=j;k++)
                    cost[i][j]+=abs(dis[k]-dis[(i+j)/2]);//仓库肯定修在俩个餐厅之间,这就是求仓库到每个餐厅的距离。
            }
            for(i=1;i<=n;i++)//寻找距离所有餐厅最短的三个仓库的总长度,
                dp[1][i]=cost[1][i];
            for(i=2;i<=m;i++)
                for(j=i;j<=n;j++)
                for(k=i-1;k<=j-1;k++)
                dp[i][j]=min(dp[i][j],dp[i-1][k]+cost[k+1][j]);//判断哪个仓库到餐厅的距离短。
            printf("Chain %d\nTotal distance sum = %d\n\n",++cnt,dp[m][n]);
    }
   // system("pause");
    return 0;
}

版权声明:博主情人,外人误碰!!!

相关文章推荐

暑期dp46道(30) HDOJ 1227 Fast Food

题目链接:hdoj 1227 题意:给定n个快餐店的位置,要在其中m个位置建商店,使得n餐厅到离自己最近的商店    距离的和最小,求这个最优解; 题解:首先...
  • ADjky
  • ADjky
  • 2016-08-11 17:08
  • 113

HDU 1227 Fast Food DP

http://acm.hdu.edu.cn/showproblem.php?pid=1227 题目大意: n个饭店在一条直线上,要在这条直线上建立k个仓库,使各个仓库到商店距离和最小。(仓...

hdu1227 Fast Food--DP

原题链接: http://acm.hdu.edu.cn/showproblem.php?pid=1227 一:原题内容 Problem Description The fastfood ch...

【DP|数学+预处理】HDU-1227 Fast Food

在n个点上选择k个点设为基地向n个点运送物资,使得运送物资的距离之和最小。

[ACM] HDU 1227 Fast Food (经典Dp)

Fast Food Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total ...

(HDU1227)Fast Food(DP)

どこでもドア:http://acm.hdu.edu.cn/showproblem.php?pid=1227 一共有n个商店,有k个仓库,设计仓库位置,使每个商店到,离当前商店最近,的一个仓库的距离和...

hdu1227 Fast Food

Fast Food Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Tota...

HDU 1227 Fast Food

Fast Food Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Tota...

hdu fast food(1227)

题目大意: 有N个旅馆,要修建M个

poj 1485 Fast Food dp

题意:给定n个在一条直线上的快餐店,在这n个点处,可建k个仓库,每个快餐店去最近的仓库取货,问走的路程和最小是多少,并输出每个店的位置及供给区间   状态转移方程: dp[i][j] = dp[...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)