UVA 11400

基础的线性dp,紫书上的例题。

#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
#define LL long long
#define ull unsigned long long
#define FOR(i,x,y) for(int i=x;i<=y;i++)
using namespace std;
const int maxn = 1000 + 10;
const int INF = 100000000;
struct Light
{
	int V;
	int K;
	int C;
	int L;
}lights[maxn];
int dp[maxn];
int N;
bool cmp(const Light A , const Light B)
{
	return A.V < B.V;
}
int s[maxn];
int main()
{
	while(cin>>N && N)
	{
		FOR(i,1,N)
		   cin>>lights[i].V>>lights[i].K>>lights[i].C>>lights[i].L;
		sort(lights+1,lights+1+N,cmp);
		memset(dp,0,sizeof(dp));
	    FOR(i,1,N)
	       s[i] = s[i-1] + lights[i].L;
		//FOR(i,1,N)
		  // dp[i] = dp[i-1] + lights[i].L * lights[i].C + lights[i].K;
		FOR(i,1,N)
		{
			int res = INF;
			FOR(j,0,i-1)
			  res = min(res,dp[j]+(s[i]-s[j])*lights[i].C+lights[i].K);
			dp[i] = res;
		}
		cout<<dp[N]<<endl;
	}
	return 0;
}