【线性结构上的动态规划】UVa 11400 - Lighting System Design
Problem F
Lighting System
Design
Input: Standard
Input
Output: Standard
Output
You are given the task to design
a lighting system for a huge conference hall. After doing a lot of calculation
& sketching, you have figured out the requirements for an energy-efficient
design that can properly illuminate the entire hall. According to your design,
you need lamps of n different power
ratings. For some strange current regulation method, all the lamps need to be
fed with the same amount of current. So, each category of lamp has a
corresponding voltage rating. Now, you know the number of lamps & cost of
every single unit of lamp for each category. But the problem is, you are to buy equivalent voltage sources for all the lamp
categories. You can buy a single voltage source for each category (Each source
is capable of supplying to infinite number of lamps of its voltage rating.)
& complete the design. But the accounts section of your company soon
figures out that they might be able to reduce the total system cost by eliminating
some of the voltage sources & replacing the lamps of that category with
higher rating lamps. Certainly you can never replace a lamp by a lower rating
lamp as some portion of the hall might not be illuminated then. You are more
concerned about money-saving than energy-saving. Find the minimum possible cost
to design the system.
Input
Each case in the input begins
with n (1<=n<=1000), denoting the number
of categories. Each of the following n lines describes a category. A category
is described by 4 integers - V (1<=V<=132000), the voltage rating,
K (1<=K<=1000), the cost of a voltage source of this rating, C
(1<=C<=10), the cost of a lamp of this rating & L (1<=L<=100),
the number of lamps required in this category. The input terminates with a test case where n = 0. This case should not be
processed.
Output
For each test case, print the minimum possible cost to
design the system.
Sample Input Output
for Sample Input
3
100 500 10 20
120 600 8 16
220 400 7 18
0
读题时题意理解的不太好,看分析后才明白。给出n种电灯泡,含四种属性(V-电压,K-电源费用,C-每个灯泡费用,L-所需灯泡数量);输出最合理的照明系统设计方案,要求花费最少的钱。
自己没考虑到的是:每种电压的灯泡要么全换,要么不换。因为如果只将部分灯泡换成另一种灯泡,则需要买两种不同电压的电源。这样不划算。而且,电压高的灯泡,因电流大小相等,故功率也大,这样会节省更多的钱。
代码很简单:
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = ;
struct Lamp
{
int V, K, C, L;
bool operator < (const Lamp& a) const
{
return V < a.V;
}
}lamp[maxn];
int dp[maxn], sum[maxn];
int main()
{
int n;
while(~scanf("%d", &n) && n)
{
for(int i = ; i <= n; i++)
{
scanf("%d%d%d%d", &lamp[i].V, &lamp[i].K, &lamp[i].C, &lamp[i].L);
}
sort(lamp+, lamp++n);
memset(sum, , sizeof(sum));
memset(dp, , sizeof(dp));
sum[] = ;
for(int i = ; i <= n; i++)
{
sum[i] = sum[i-]+lamp[i].L;
if(i == ) dp[i] = lamp[i].C*sum[i]+lamp[i].K;
else
for(int j = ; j < i; j++)
{
if(dp[i] == ) dp[i] = dp[j]+lamp[i].C*(sum[i]-sum[j])+lamp[i].K;
else dp[i] = min(dp[j]+lamp[i].C*(sum[i]-sum[j])+lamp[i].K, dp[i]);
}
}
printf("%d\n", dp[n]);
}
return ;
}
【线性结构上的动态规划】UVa 11400 - Lighting System Design的更多相关文章
- UVa 11400 Lighting System Design(DP 照明设计)
意甲冠军 地方照明系统设计 总共需要n不同类型的灯泡 然后进入 每个灯电压v 相应电压电源的价格k 每一个灯泡的价格c 须要这样的灯泡的数量l 电压低的灯泡能够用电压高的灯泡替换 ...
- UVa 11400 - Lighting System Design(线性DP)
链接: https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem& ...
- uva 11400 - Lighting System Design(动态规划 最长上升子序列问题变型)
本题难处好像是在于 能够把一些灯泡换成电压更高的灯泡以节省电源的钱 .所以也才有了对最优方案的探求 好的处理方法是依照电压从小到大排序.仅仅能让前面的换成后面的.也就满足了把一些灯泡换成电压更高的灯泡 ...
- UVa 11400 Lighting System Design【DP】
题意:给出n种灯泡,分别给出它们的电压v,电源费用k,每个灯泡的费用c,和所需灯泡的数量l,问最优方案的费用 看的紫书= = 首先是dp[i]为灯泡1到i的最小费用, dp[i]=min(dp[i], ...
- UVA 11400"Lighting System Design"
传送门 错误思路 正解 AC代码 参考资料: [1]:https://www.cnblogs.com/Kiraa/p/5510757.html 题意: 现给你一套照明系统,这套照明系统共包含 n 种类 ...
- UVa 11400 Lighting System Design
题意: 一共有n种灯泡,不同种类的灯泡必须用不同种电源,但同一种灯泡可以用同一种电源.每种灯泡有四个参数: 电压值V.电源费用K.每个灯泡的费用C.所需该种灯泡的数量L 为了省钱,可以用电压高的灯泡来 ...
- UVA - 11400 Lighting System Design (区间DP)
这个问题有两个点需要注意: 1. 对于一种灯泡,要么全换,要么全不换. 证明: 设一种灯泡单价为p1,电池价格为k1,共需要L个,若把L1个灯泡换成单价为p2,电池为k2的灯泡,产生的总花费为p1*L ...
- UVA 11400 Lighting System Design 照明系统设计
首先是一个贪心,一种灯泡要么全都换,要么全都不换. 先排序,定义状态d[i]为前面i种灯泡的最小花费,状态转移就是从d[j],j<i,加上 i前面的j+1到i-1种灯泡换成i的花费. 下标排序玩 ...
- UVA - 11400 Lighting System Design(照明系统设计)(dp)
题意:共有n种(n<=1000)种灯泡,每种灯泡用4个数值表示.电压V(V<=132000),电源费用K(K<=1000),每个灯泡的费用C(C<=10)和所需灯泡的数量L(1 ...
随机推荐
- poj 1469 COURSES(匈牙利算法模板)
http://poj.org/problem?id=1469 COURSES Time Limit: 1000MS Memory Limit: 10000K Total Submissions: ...
- ASP.NET(C#)中的try catch异常处理机制
在开发一个Umbraco平台系统的过程中,遇到了问题. 写的代码如下 fileUrl = MediaHelper.GetMediaUrl(Convert.ToInt32(publishedConten ...
- VC 各种情况下的窗口句柄的获取
动窗口的句柄.否则,返回值为NULL. GetSafeHwnd 函数功能:获取某个窗口对象(CWnd的派生对象)指针的句柄(HWND)时,最安全的方法是使用GetSafeHwnd()函数. 通过下面的 ...
- Java学习笔记(八):集合类
Java中对数据的存储会使用到集合类,下面我们来看看Java中常用的集合类. Collection接口 集合的接口,可以简单的理解为可以动态扩充的数组. Collection接口定义了很多相关的方法, ...
- <%%>与<scriptrunat=server>,<%=%>与<%#%>的区别
这些东西都是asp.net前台页面与后台代码交互过程中经常使用的,它们之间有的非常相似,又有一些不同.对比学习下,看看他们之间的联系与区别. 首先看<%%>与<scriptrun ...
- MYCAT介绍
为什么需要MyCat? http://www.mycat.org.cn/ http://www.csdn.net/article/2015-07-16/2825228
- plsql developer导入导出数据库方法
导出步骤: 1 tools ->export user object 选择选项,导出.sql文件 2 tools ->export tables-> Oracle Export 选择 ...
- CSS基础(02)
CSS 选择器 1.CSS3 选择器简介 在 CSS 中,选择器是一种模式,用于选择需要添加样式的元素. 语法: 下面中"CSS" 列指示该属性是在哪个 CSS 版本中定义的.(C ...
- sql prompt格式设置
sql prompt格式设置. 格式前: 格式后:
- PostgreSQL的 initdb 源代码分析之二十一
继续分析: setup_schema(); 展开: 实质就是创建info_schema. cmd 是: "/home/pgsql/project/bin/postgres" --s ...