HDU 6024 Building Shops 区间dp

原创 2018年04月15日 00:53:33

Building Shops
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 701 Accepted Submission(s): 265

Problem Description
HDU’s n classrooms are on a line ,which can be considered as a number line. Each classroom has a coordinate. Now Little Q wants to build several candy shops in these n classrooms.

The total cost consists of two parts. Building a candy shop at classroom i would have some cost ci. For every classroom P without any candy shop, then the distance between P and the rightmost classroom with a candy shop on P’s left side would be included in the cost too. Obviously, if there is a classroom without any candy shop, there must be a candy shop on its left side.

Now Little Q wants to know how to build the candy shops with the minimal cost. Please write a program to help him.

Input
The input contains several test cases, no more than 10 test cases.
In each test case, the first line contains an integer n(1≤n≤3000), denoting the number of the classrooms.
In the following n lines, each line contains two integers xi,ci(−109≤xi,ci≤109), denoting the coordinate of the i-th classroom and the cost of building a candy shop in it.
There are no two classrooms having same coordinate.

Output
For each test case, print a single line containing an integer, denoting the minimal cost.

Sample Input
3
1 2
2 3
3 4
4
1 7
3 1
5 10
6 1

Sample Output
5
11

题意:
有n个教室,现在想在这n个教室中建一些超市,问你最少费用为多少?
费用分为两种:
1:在第i个教室建超市,费用因为ci

2:没有建超市的教室的费用为它和它左边最接近的超市的坐标之间的距离

第一眼就觉得可以用区间dp来写,和之前写过的POJ - 1260换珍珠的区间dp很像

ps:计算diss的时候,没有用longlong,WA到怀疑人生QAQ

#include <cmath>
#include <stdio.h>
#include <cstring>
#include<iostream>
#include <algorithm>
using namespace std;
struct node { long long int x,c; }in[3005];
bool cmp(node n1,node n2) { return n1.x < n2.x; }
int main() {
    int n;
    long long int dis[3005],dp[3005];//x,c的范围都很大,所以用longlong
    while(scanf("%d",&n)!=EOF){
        memset(dp,0,sizeof(dp));
        memset(dis,0,sizeof(dis));
        for(int i=1;i<=n;i++) scanf("%lld%lld",&in[i].x,&in[i].c);
        sort(in+1,in+1+n,cmp);//这里必须排序,因为有可能乱序输入
        for(int i=1;i<=n;i++){
            dis[i]+=in[i].x-in[1].x;
            dis[i]+=dis[i-1];
            //cout<<dis[i]<<endl;
        }
        for(int i=n;i>1;i--){
            dp[i]=dp[i+1]+in[i].x-in[1].x;//第i个教室不建糖果屋的费用
            for(int j=i+1;j<=n+1;j++){//第i个教室建糖果屋
                long long int diss=0;
                diss=dis[j-1]-dis[i]-(j-1-i)*(in[i].x-in[1].x);//范围(i+1,j-1)内的教室到i的距离
                dp[i]=min(dp[i],dp[j]+diss+in[i].c);//取最小dp[j]是之前求出的最优解
            }
            //cout<<dp[i]<<endl;
        }
        dp[1]+=in[1].c;//第一个教室必定要建糖果屋
        dp[1]+=dp[2];
        printf("%lld\n",dp[1]);
    }
    return 0;
}

hdu 6024 Building Shops 【递归+记忆存储】

hdu 6024 Building Shops 【递归+记忆存储】 题意:                     有 N 个教学楼,在每个教学楼里学习的学生只会到其左边第一个有小卖铺...
  • weifucheng520
  • weifucheng520
  • 2017-05-08 20:54:40
  • 362

HDU6024-Building Shops-简单DP

//传送门: http://acm.hdu.edu.cn/showproblem.php?pid=6024 #include #include #include #include #inclu...
  • survivorone
  • survivorone
  • 2017-05-07 21:54:35
  • 629

HDU6024+简单dp

Building Shops Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others...
  • hyyjiushiliangxing
  • hyyjiushiliangxing
  • 2017-07-13 09:22:15
  • 173

(HDU 6024 女生专场)Building Shops 简单DP详细解答

Building Shops Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others...
  • STILLxjy
  • STILLxjy
  • 2017-05-19 08:57:21
  • 662

HDU 6024 Building Shops DP 提升

问题描述 HDU的n个教室在一条线上,可以被认为是数字线。每个教室都有一个坐标。现在,小Q想在这些n个教室里建几个糖果店。 总成本由两部分组成。在教室里建一个糖果店我会有一些成本ci。对于没有任何...
  • deepseazbw
  • deepseazbw
  • 2017-05-09 15:15:15
  • 445

HDU6024(dp)

Building ShopsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) ...
  • creatorx
  • creatorx
  • 2017-05-11 18:46:05
  • 103

HDU 6024 Building Shops

题意:                     有 N 个教学楼,在每个教学楼里学习的学生只会到其左边第一个有小卖铺的教学楼买东西,两个教学楼之间的花费为其距离之差。           由以上规则第...
  • DT2131
  • DT2131
  • 2017-05-08 16:33:51
  • 528

HDU - 6024 - Building Shops

HDU - 6024 - Building Shops 原命题链接 :HDU 题目大意 有很多空的教室被考虑建成糖果屋,现在有n间特定教室可能被建为糖果屋,但是建造糖果屋需要一定量的花费...
  • TSTNOE
  • TSTNOE
  • 2018-04-07 02:46:27
  • 8

Building Shops HDU - 6024

HDU’s nn classrooms are on a line ,which can be considered as a number line. Each classroom has a co...
  • we1215053460
  • we1215053460
  • 2017-10-21 20:00:58
  • 54

HDU—6024(Building Shops)

Building Shops Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others...
  • xiangkaijie
  • xiangkaijie
  • 2017-08-29 16:58:49
  • 121
收藏助手
不良信息举报
您举报文章:HDU 6024 Building Shops 区间dp
举报原因:
原因补充:

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