uva 11400 Lighting System Design （DP)_例题 9-6 照明系统设计-CSDN博客

本文链接：https://blog.csdn.net/u011836218/article/details/18233573

Problem G : Lighting System Design

Problem F
Lighting SystemDesign

Input: StandardInput

Output: StandardOutput

You are given the task to designa lighting system for a huge conference hall. After doing a lot of calculation& sketching, you have figured out the requirements for an energy-efficientdesign that can properly illuminate the entire hall. According to your design,you need lamps of n different powerratings. For some strange current regulation method, all the lamps need to befed with the same amount of current. So, each category of lamp has acorresponding voltage rating. Now, you know the number of lamps & cost ofevery single unit of lamp for each category. But the problem is, you are to buy equivalent voltage sources for all the lampcategories. You can buy a single voltage source for each category (Each sourceis capable of supplying to infinite number of lamps of its voltage rating.)& complete the design. But the accounts section of your company soonfigures out that they might be able to reduce the total system cost by eliminatingsome of the voltage sources & replacing the lamps of that category withhigher rating lamps. Certainly you can never replace a lamp by a lower ratinglamp as some portion of the hall might not be illuminated then. You are moreconcerned about money-saving than energy-saving. Find the minimum possible costto design the system.

Input

Each case in the input beginswith n (1<=n<=1000), denoting the numberof categories. Each of the following n lines describes a category. A categoryis 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 beprocessed.

Output

For each test case, print the minimum possible cost todesign the system.

Sample Input�� Outputfor Sample Input

100 500 10 20

120 600 8 16

220 400 7 18

778

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

#define ll int
const int maxn = 1100;
struct Lamp{
	int V , K , C , L;
	Lamp(int v = 0 , int k = 0, int c = 0,  int l = 0){
		V = v , K = k , C = c , L = l;
	}
}lamp[maxn];
int n , pre[maxn];
ll dp[maxn];

bool cmp(Lamp L1 , Lamp L2){
	return L1.V > L2.V;
}

void initial(){
	for(int i = 0;i < maxn;i++){
		dp[i] = 0;
	}
}

void readcase(){
	int v, k , c , l ;
	for(int i = 0;i < n;i++){
		scanf("%d%d%d%d" , &v , &k , &c , &l);
		lamp[i] = Lamp(v , k , c , l);
	}
}

void computing(){
	sort(lamp, lamp+n , cmp);
	dp[0] = lamp[0].K+lamp[0].C*lamp[0].L;
	for(int i = 1;i < n;i++){
		dp[i] = dp[i-1]+lamp[0].C*lamp[i].L;
	}
	for(int i = 1;i < n;i++){
		int temp = dp[i-1]+lamp[i].K;
		for(int j = i;j < n;j++){
			temp += lamp[j].L*lamp[i].C;
			if(dp[j] > temp){
				dp[j] = temp;
			}
		}
	}
	printf("%d\n" , dp[n-1]);
}

int main(){
	//freopen("in" , "r" , stdin);
	while(cin >> n && n){
		initial();
		readcase();
		computing();
	}
	return 0;
}