UVa - 11400 - Lighting System Design

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

778

动态规划。首先明确一点，如果一种灯泡需要更换，那么这类灯泡就要全换。选取状态d[i]为灯泡1~i 的最小开销，状态转移方程为：d[i] = min(d[i], d[j] + (s[i] - s[j]) * lamp[i].c + lamp[i].k); 表示前 j 个用最优方案，第 j = 1 ~ i 个都用第i种电源。最终答案为d[n]。

AC代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <stack>
#include <queue>
#include <bitset> 
#include <cassert> 
#include <cmath>
#include <functional>

using namespace std;

const int maxn = 1005;

struct Lamp
{
	int v, k, c, l;
	bool operator < (const Lamp& rhs) const {
		return v < rhs.v;
	}
}lamp[maxn];

int n, s[maxn]; // s[i]为前i种灯泡的总数量
int d[maxn]; // d[i]为灯泡1~i的最小开销

void init()
{
	for (int i = 1; i <= n; i++) {
		cin >> lamp[i].v >> lamp[i].k >> lamp[i].c >> lamp[i].l;
	}
	sort(lamp + 1, lamp + n + 1); // 注意排序范围

	s[0] = 0;
	for (int i = 1; i <= n; i++) {
		s[i] = s[i - 1] + lamp[i].l;
	}
}

void solve()
{
	d[0] = 0;
	for (int i = 1; i <= n; i++) {
		d[i] = s[i] * lamp[i].c + lamp[i].k; // 前i灯泡全买类型i
		for (int j = 1; j <= i; j++) {
			d[i] = min(d[i], d[j] + (s[i] - s[j]) * lamp[i].c + lamp[i].k);
		}
	}
	cout << d[n] << endl;
}

int main()
{
	ios::sync_with_stdio(false);
	while (cin >> n && n) {
		init();
		solve();
	}

	return 0;
}