SGU_148 B-Station(排序)

B-Station

time limit per test: 0.25 sec. memory limit per test: 4096 KB

Problem Description

There is a half-waterlogged underwater station not far from the famous country Berland. The station consists of N levels. The following information is known about each level: Wi - the weigth of water on i-th before the act of terrorism, Li - the weight of water the i-th level can hold, and Pi - amount of money terrorist are required to depressurize i-th level. All the water from the depressurized level pours to the next level. If the weight of the water on i-th level is more then Li, then it becomes depressurized. The terrorists from Pivland want to depressurize the last (N-th) level spending the least amount of money. They hired you to do this.

Input

The first line of input contains the natural number N (1<=N<=15000). Each of the following N lines contains 3 numbers Wi, Li, Pi (0<=Wi,Li,Pi<=15000).

Output

Write to the output the numbers of levels, which must be depressurized.

Sample Input

3
1000 1000 1
0 1000 2
2 10 100

Sample Output

1
2

题意

有n个容器分布在n层，每一层的容器有三个值wi,li,pi分别是容器内水的体积，容器的容积和手动摧毁容器的代价。如果容器内的水的体积超过容器的容积，容器将会被摧毁，容器里的水会全部流到下一层容器，容器也可以被手动摧毁，但需要取出pi的代价。求摧毁最低层(第n个)容器最小的代价。

题解：

摧毁第n个容器，则一定是将某一层的之后的容器全部摧毁。分别求从第i层开始摧毁的代价，取最小值即可。但这样是O(n^2)的，显然不行。已知第i层之后全部摧毁的结果，那第i+1层的结果呢？
少了摧毁第i层的花费，同时所有层被摧毁时的水量相比上一次结果都少了wi。部分的可能需要由自动摧毁变为手动摧毁。
先处理出全部摧毁的结果，每一层按 被摧毁时的水的体积-容器 为键值排序。然后分别考虑2,3,…,n-1。每次统计出由自动摧毁变为手动摧毁的代价和即可。

#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<ctype.h>
#include<cstring>
#include<set>
#include<queue>
#include<stack>
#include<iterator>
#define dbg(x) cout<<#x<<" = "<<x<<endl;
#define INF 0x3f3f3f3f
#define eps 1e-6
 
using namespace std;
typedef long long LL;   
typedef pair<int, int> P;
const int maxn = 15100;
const int mod = 10007;
struct node{
    int id, ch;
}a[maxn];
int w[maxn], l[maxn], p[maxn], b[maxn];
bool cmp(node a, node b);

int main()
{
    int n, i, j, k, sum, psum, num;
    int mi, l1, r1;
    sum = psum = num = 0;
    scanf("%d", &n);
    for(i=1;i<=n;i++)
        scanf("%d %d %d", &w[i], &l[i], &p[i]);
    for(i=1;i<=n;i++){
        sum += w[i];
        a[i].id = i, a[i].ch = sum - l[i];
    }
    sort(a+1, a+1+n, cmp);
    sum = 0;
    j = 1;
    while(j<=n && a[j].ch-sum <= 0)
        psum += p[a[j].id], j++;
    mi = psum, r1 = 0, l1 = j;
    for(i=1;i<n;i++)
    {
        sum += w[i], psum -= p[i];
        while(j<=n && a[j].ch-sum <= 0)
            psum += p[a[j].id], j++;
        if(psum < mi){
            mi = psum, r1 = i, l1 = j;
        }
    }
    for(i=1;i<l1;i++)
        b[a[i].id] = 1;
    for(i=r1+1;i<=n;i++)
        if(b[i])printf("%d\n", i);
    return 0;
}

bool cmp(node a, node b)
{
    return a.ch < b.ch;
}