UVa 11400 - Lighting System Design（白书，比较好）

题目地址：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=26&problem=2395&mosmsg=Submission+received+with+ID+17138912

思路：和HDU1300类型查不到，状态转移方程为dp[i] = min(dp[i],dp[j]+sum * a[i].c + a[i].k);dp[i]为前i个灯泡的最下值，其中sum为j+1到i的总数量

AC代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <climits>
#include <cmath>
#include <cctype>
const int inf = 0x3f3f3f3f;//1061109567
typedef long long LL;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
using namespace std;
struct node
{
    int v;
    int k;
    int c;
    int l;
}a[1010];
int dp[1010];
bool cmp(node a,node b)
{
    return a.v < b.v;
}
int main()
{
    int n;
    while(scanf("%d",&n) && n)
    {
        memset(dp,0,sizeof(dp));
        for(int i=1; i<=n; i++)
            scanf("%d%d%d%d",&a[i].v,&a[i].k,&a[i].c,&a[i].l);
        sort(a+1,a+n+1,cmp);//注意这里的参数
        for(int i=1; i<=n; i++)
        {
            dp[i] = dp[i-1] + a[i].l * a[i].c + a[i].k;//每次不合并，直接重开
            for(int j=0; j<=i; j++)
            {
                int sum = 0;
                for(int k=j+1; k<=i; k++)
                    sum += a[k].l;
                dp[i] = min(dp[i],dp[j]+sum * a[i].c + a[i].k);
            }
        }
        printf("%d\n",dp[n]);
    }
    return 0;
}

作者的标称（用了前缀和，大致思想差不多，每次的初始值不一样）

// UVa11400 Lighting System Design
// Rujia Liu
#include<iostream>
#include<algorithm>
using namespace std;

const int maxn = 1000 + 5;

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

int n, s[maxn], d[maxn];

int main() {
  while(cin >> n && n) {
    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;
    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] << "\n";
  }
  return 0;
}