hdu6024 Building Shops(区间dp)

【hdu6024 Building Shops(区间dp)】的更多相关文章

hdu6024 Building Shops(区间dp)

https://cn.vjudge.net/problem/HDU-6024 分开考虑某一点种与不种,最后取二者的最小值. dp[i][1] = min(dp[i-1][0], dp[i-1][1])+c[i]; dp[i][0]则是j从i-1~1递减,判断当j种是,i的最小值,然后取总的最小. 注意dp初始化为INF,以及要开long long #include<iostream> #include<cstdio> #include<cstring> #include…

HDU6024 Building Shops 2017-05-07 18:33 30人阅读评论(0) 收藏

Building Shops Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) …

HDU6024：Building Shops（DP）

传送门题意在一条直线上有n个教室,现在要设置糖果店,使得最后成本最小,满足以下两个条件: 1.若该点为糖果店,费用为cost[i]; 2.若不是,则为loc[i]-最近的糖果店的loc 分析 dp方程不好想,我们观察一下,如果在第i个点设置最后一个糖果店,那么它将影响到它之前的糖果店,那么第i个点的费用必然由前i-1个的位置上费用最小的糖果店转移过来,这里糖果店费用计算为\(cost[i]+\sum_{j=i+1}^n(dis[j]-dis[i])\),那么转移方程为\[dp[i]=dp[j…

HDU6024：Building Shops（简单DP）

Building Shops Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 4446 Accepted Submission(s): 1551 Problem Description HDU’s n classrooms are on a line ,which can be considered as a number li…

HDU5900 QSC and Master（区间DP + 最小费用最大流）

题目 Source http://acm.hdu.edu.cn/showproblem.php?pid=5900 Description Every school has some legends, Northeastern University is the same. Enter from the north gate of Northeastern University,You are facing the main building of Northeastern University.…

2016 年沈阳网络赛---QSC and Master(区间DP)

题目链接 http://acm.hdu.edu.cn/showproblem.php?pid=5900 Problem Description Every school has some legends, Northeastern University is the same. Enter from the north gate of Northeastern University,You are facing the main building of Northeastern Universi…