Time Limit: 1000MS | Memory Limit: 65536KB | 64bit IO Format: %lld & %llu |
Description
Help the cows build the tallest space elevator possible by stacking blocks on top of each other according to the rules.
Input
* Lines 2..K+1: Each line contains three space-separated integers: h_i, a_i, and c_i. Line i+1 describes block type i.
Output
Sample Input
3 7 40 3 5 23 8 2 52 6
Sample Output
48
Hint
From the bottom: 3 blocks of type 2, below 3 of type 1, below 6 of type 3. Stacking 4 blocks of type 2 and 3 of type 1 is not legal, since the top of the last type 1 block would exceed height 40.
注意背包容量
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
using namespace std;
typedef long long LL;
const int N = 201000;
int dp[N];
struct node
{
int h,num, a;
}p[N];
int cmp(node x, node y)
{
return x.a<y.a;
}
int main()
{
int n;
while(scanf("%d", &n)!=EOF)
{
for(int i=0;i<n;i++)
{
scanf("%d %d %d", &p[i].h, &p[i].a,&p[i].num );
}
sort(p,p+n,cmp);
memset(dp,-1,sizeof(dp));
dp[0]=0;
int ans=0;
for(int i=0;i<n;i++)
{
for(int j=0;j<=p[i].a;j++)
{
if(dp[j]>=0)
{
dp[j]=p[i].num;
ans=max(j,ans);
}
else if(j<p[i].h||dp[j-p[i].h]<=0)
{
dp[j]=-1;
}
else
{
dp[j]=dp[j-p[i].h]-1;
ans=max(j,ans);
}
}
}
printf("%d\n",ans);
}
return 0;
}