背包问题+贪心
设
f[i]
表示使用
i
的空间获得物品的最大价值,那么
我们发现对于物品
i
,只能转移
所以如果保证 (q[i]−p[i]) 递减,可以使得 允许转移的区间 增大。
于是先排序再DP就可以啦~
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <utility>
#include <iostream>
#include <algorithm>
template<class Num>void read(Num &x)
{
char c; int flag = 1;
while((c = getchar()) < '0' || c > '9')
if(c == '-') flag *= -1;
x = c - '0';
while((c = getchar()) >= '0' && c <= '9')
x = (x<<3) + (x<<1) + (c-'0');
x *= flag;
return;
}
template<class Num>void write(Num x)
{
if(x < 0) putchar('-'), x = -x;
static char s[20];int sl = 0;
while(x) s[sl++] = x%10 + '0',x /= 10;
if(!sl) {putchar('0');return;}
while(sl) putchar(s[--sl]);
}
const int maxn = 505, maxm = 5050;
struct item
{
int v, p, q;
void init()
{
read(p), read(q), read(v);
}
}g[maxn];
bool cmp(const item &a,const item &b)
{
return a.q - a.p > b.q - b.p;
}
int n, m, f[maxm];
int solve()
{
int ans = 0;
memset(f, 0, sizeof(f));
for(int i = 1; i <= n; i++) g[i].init();
std::sort(g + 1, g + n + 1, cmp);
for(int i = 1; i <= n; i++)
for(int j = m; j >= g[i].p; j--)
if(m - (j - g[i].p) >= g[i].q)
f[j] = std::max(f[j - g[i].p] + g[i].v, f[j]);
for(int i = 1; i <= m; i++) ans = std::max(ans, f[i]);
return ans;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("3466.in","r",stdin);
freopen("3466.out","w",stdout);
#endif
while(scanf("%d%d",&n,&m) != EOF) write(solve()), puts("");
#ifndef ONLINE_JUDGE
fclose(stdin);
fclose(stdout);
#endif
return 0;
}