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的更多相关文章

  1. UVa 11400 Lighting System Design(DP 照明设计)

    意甲冠军  地方照明系统设计  总共需要n不同类型的灯泡  然后进入 每个灯电压v  相应电压电源的价格k  每一个灯泡的价格c   须要这样的灯泡的数量l   电压低的灯泡能够用电压高的灯泡替换   ...

  2. UVa 11400 - Lighting System Design(线性DP)

    链接: https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem& ...

  3. uva 11400 - Lighting System Design(动态规划 最长上升子序列问题变型)

    本题难处好像是在于 能够把一些灯泡换成电压更高的灯泡以节省电源的钱 .所以也才有了对最优方案的探求 好的处理方法是依照电压从小到大排序.仅仅能让前面的换成后面的.也就满足了把一些灯泡换成电压更高的灯泡 ...

  4. UVa 11400 Lighting System Design【DP】

    题意:给出n种灯泡,分别给出它们的电压v,电源费用k,每个灯泡的费用c,和所需灯泡的数量l,问最优方案的费用 看的紫书= = 首先是dp[i]为灯泡1到i的最小费用, dp[i]=min(dp[i], ...

  5. UVA 11400"Lighting System Design"

    传送门 错误思路 正解 AC代码 参考资料: [1]:https://www.cnblogs.com/Kiraa/p/5510757.html 题意: 现给你一套照明系统,这套照明系统共包含 n 种类 ...

  6. UVa 11400 Lighting System Design

    题意: 一共有n种灯泡,不同种类的灯泡必须用不同种电源,但同一种灯泡可以用同一种电源.每种灯泡有四个参数: 电压值V.电源费用K.每个灯泡的费用C.所需该种灯泡的数量L 为了省钱,可以用电压高的灯泡来 ...

  7. UVA - 11400 Lighting System Design (区间DP)

    这个问题有两个点需要注意: 1. 对于一种灯泡,要么全换,要么全不换. 证明: 设一种灯泡单价为p1,电池价格为k1,共需要L个,若把L1个灯泡换成单价为p2,电池为k2的灯泡,产生的总花费为p1*L ...

  8. UVA 11400 Lighting System Design 照明系统设计

    首先是一个贪心,一种灯泡要么全都换,要么全都不换. 先排序,定义状态d[i]为前面i种灯泡的最小花费,状态转移就是从d[j],j<i,加上 i前面的j+1到i-1种灯泡换成i的花费. 下标排序玩 ...

  9. UVA - 11400 Lighting System Design(照明系统设计)(dp)

    题意:共有n种(n<=1000)种灯泡,每种灯泡用4个数值表示.电压V(V<=132000),电源费用K(K<=1000),每个灯泡的费用C(C<=10)和所需灯泡的数量L(1 ...

随机推荐

  1. Hibernate、Mybatis 通过数据库表反向生成java类和配置

    一.通过MyEclipse生成Hibernate类文件和hbm.xml文件,或者annotation文件    (转载孙宇老师的文章) 二.Mybatis生成实体类和配置文件: myeclipse下生 ...

  2. vector 的resize与reserve

    最近遇到一个坑,简单说来是resize与reserve的功能混淆了. 如下: 如果调用resize的化,编译会出错,如果给Text提供默认构造函数,则可以编译通过,最终输出的结果为10. 如果调用re ...

  3. thymeleaf的属性优先级

    所有Thymeleaf属性定义一个数字优先,建立他们的顺序执行的标签.这个顺序是: Order Feature Attributes 1 Fragment inclusion th:includeth ...

  4. MFC实现数独(2)

    主要功能描述: 运行程序后对话框会显示一个9x9的待输入数独区域,并提供随机生成数独和生成数独按钮,生成数独按钮后会创建数独并随机显示其中一个至数独区域,随机生成数独会从已生成的数独中随机获取一个并显 ...

  5. jQuery UI 多选下拉框插件:jquery-ui-multiselect

    前一个项目,由于项目需求,需要大量使用到下拉多选框,而由于本人又不会写有关 CSS 样式,所以,便上网找到了这个 jQuery 插件:jquery-ui-multiselect .该款插件提供了基本下 ...

  6. Javaweb监听器(2)

    属性监听器:ServletRequestAtttributeListener/HttpSeessionAttributeListener/ServletContextAttributeListener ...

  7. C++访问权限

    1.C++类本身没有访问权限的概念,就是class Base. 2.类成员的访问权限有:public.protected.private 3.类的继承方式有:public.protected.priv ...

  8. Mouse_event 鼠标点击

    //这样就是左键单击 mouse_event( MOUSEEVENTF_LEFTDOWN, 0, 0, 0, 0 );// 按下mouse_event( MOUSEEVENTF_LEFTUP, 0, ...

  9. 深度学习论文笔记-Deep Learning Face Representation from Predicting 10,000 Classes

    来自:CVPR 2014   作者:Yi Sun ,Xiaogang Wang,Xiaoao Tang 题目:Deep Learning Face Representation from Predic ...

  10. Nhibernate中 Many-To-One 中lazy="proxy" 延迟不起作用的原因

    2010-07-15 12:10 by 彭白洋, 322 阅读, 0 评论, 收藏, 编辑 NHibernate中 Many-To-One 中lazy="proxy" 延迟不起作用 ...