解题报告 之 UVA11400 Lighting System Design

解题报告 之 UVA11400 Lighting System Design

Description

                                                                      

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

 

题目大意：有一个照明系统需要用到n种灯，每种灯的电压为V，电源费用K，每个灯泡费用为C，需要该灯的数量为L。注意到，电压相同的灯泡只需要共享一个对应的电源即可，还有电压低的灯泡可以被电压高的灯泡替代。为了节约成本，你将设计一种系统，使之最便宜。

分析：首先需要明确一种灯泡要么全部换，要么不换。如果换一部分的话，首先电源费用得不到节约，那么节约的部分就只来自于换的那部分灯泡，既然可以节约钱干嘛不干脆全部换了呢？所以要么全换，要么不换。然后我们的算法就是先按照V排序，然后cost[i]表示解决前 i 种灯泡的最优解，那么转移方程是枚举j<i，将j之前的保持最优解cost[j]不变，j之后的全部变成i种灯泡。有一个疑问是：是不是会漏解，为什么没有枚举替换j之前的不连续的一部分？这个问题其实不存在，因为i之前的灯泡肯定是越后面的花费越大，因为如果前面的花费反而更大的话，大可以转换为后面的灯泡。

于是乎这个算法是可行的，上代码啦：

#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int INF = 0x3f3f3f3f;

struct bulb
{
	int v, k, c, l;
	bool operator<(const bulb& rhs)const
	{
		return v < rhs.v;
	}
};

bulb light[1010];
int num[1010];
int cost[1010];

int main()
{
	int n;
	while (cin >> n&&n)
	{
		for (int i = 1; i <= n; i++)
		{
			cin >> light[i].v >> light[i].k >> light[i].c >> light[i].l;
		}

		sort(light+1, light + n+1);
		
		num[0] = 0;
		for (int i = 1; i <= n; i++)
		{
			num[i] = num[i - 1] + light[i].l;
		}

		
		cost[0] = 0;
		for (int i = 1; i <= n; i++)
		{
			cost[i] = INF;
			for (int j = 0; j <= i; j++)
			{
				cost[i] = min(cost[i], cost[j] + (num[i] - num[j])*light[i].c + light[i].k);
			}
		}
		cout << cost[n] << endl;
	}
	return 0;
}

啦啦啦，就过啦！