紫书 照明系统设计 UVa11400

#include<iostream>
#include<string>
#include<cassert>
#include<algorithm>
#include<map>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<vector>
#include<set>
#include<sstream>
#include<fstream>
#include<cstdio>
#include<queue>
#include<unordered_map>
#include<tuple>
#include<complex>
#include<chrono>
#include<iomanip>
#include<list>
#include<deque>
#include<functional>
#include<iterator>
using namespace std;
const int maxn = 1000 + 10;
int d[maxn];
int s[maxn];
const int INF = numeric_limits<int>::max();
struct Lamb
{
	int v;
	int k;
	int c;
	int L;
	bool operator<(const Lamb& rhs)
	{
		return v < rhs.v;
	}
}lamb[maxn];
int main()
{
	//freopen("input.txt", "r", stdin);
	int n;
	while (scanf("%d", &n) == 1 && n)
	{
		s[0] = 0;
		for (int i = 1; i <= n; ++i)
		{
			scanf("%d%d%d%d", &lamb[i].v,&lamb[i].k,&lamb[i].c,&lamb[i].L);
		}
		sort(lamb + 1, lamb + n + 1);
		for (int i = 1; i <= n; ++i)
		{
			s[i] = s[i - 1] + lamb[i].L;
		}
		memset(d, 0, sizeof(d));
		
		for (int i = 1; i <= n; ++i)
		{
			int minc = INF;
			for (int j = 0; j < i; ++j)
			{
				minc = min(minc, d[j] + (s[i] - s[j]) * lamb[i].c + lamb[i].k);
			}
			d[i] = minc;
		}
		cout << d[n] << endl;
	}
}