https://www.luogu.com.cn/problem/P1802
思路:
01
01
01背包的简单变形吧,有两种决策:
d
p
[
j
]
=
m
a
x
(
d
p
[
j
]
+
l
o
s
e
[
i
]
,
d
p
[
j
−
u
s
e
[
i
]
]
+
w
i
n
[
i
]
)
dp[j]=max(dp[j]+lose[i],dp[j-use[i]]+win[i])
dp[j]=max(dp[j]+lose[i],dp[j−use[i]]+win[i])
#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define pr pair<int,int>
using namespace std;
typedef long long ll;
int n,m;
ll dp[1005];
int v1[1005],v2[1005],w[1005];
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
scanf("%d%d%d",&v1[i],&v2[i],&w[i]);
for(int i=1;i<=n;i++)
{
for(int j=m;j>=w[i];j--)
dp[j]=max(dp[j]+v1[i],dp[j-w[i]]+v2[i]);
for(int j=w[i]-1;j>=0;j--)
dp[j]+=v1[i];
}
printf("%lld\n",dp[m]*5);
return 0;
}