Lighting System Design UVA - 11400

按照紫书的思路，对灯泡按照电压排序之后，每次选取一类灯泡被当前灯泡替代，来寻找最优的解并且进行相应的更新，最后输出最终计算出来的最优解即可。具体实现见如下代码：

#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<deque>
using namespace std;

struct node{
	int V, K, C, L;
};

int n;

bool compare(const node& a,const node& b){
	return a.V < b.V;
}

int main(){
	while (cin >> n&&n){
		vector<node> v;
		int amount[1010];
		int value[1010];
		for (int i = 0; i < n; i++){
			node temp;
			cin >> temp.V >> temp.K >> temp.C >> temp.L;
			v.push_back(temp);
			
		}
		sort(v.begin(),v.end(),compare);
		for (int i = 0; i < n; i++){
     		if (i == 0) amount[i] = v[i].L;
			else amount[i] = amount[i - 1] + v[i].L;
			}
		for (int i = 0; i < n; i++){
			value[i] = amount[i] * v[i].C + v[i].K;
			for (int j = 0; j < i; j++){
				value[i] = min(value[i], value[j] + (amount[i] - amount[j])*v[i].C + v[i].K);
			}
		}
		cout << value[n-1] << endl;
	}
	return 0;
}