稍微难一点的01背包问题。
可以用w[i][0]来存主件,w[i][1],w[i][2]来存附件
本题的状态转移方程就显而易见了:
d
p
[
j
]
=
m
a
x
{
d
p
[
j
−
w
[
i
]
[
0
]
]
+
v
[
i
]
[
0
]
d
p
[
j
−
w
[
i
]
[
0
]
−
w
[
i
]
[
1
]
]
+
v
[
i
]
[
0
]
+
v
[
i
]
[
1
]
d
p
[
j
−
w
[
i
]
[
0
]
−
w
[
i
]
[
2
]
]
+
v
[
i
]
[
0
]
+
v
[
i
]
[
2
]
d
p
[
j
−
w
[
i
]
[
0
]
−
w
[
i
]
[
1
]
−
w
[
i
]
[
2
]
]
+
v
[
i
]
[
0
]
+
v
[
i
]
[
1
]
+
v
[
i
]
[
2
]
dp[j]=max \left\{ \begin{array}{rcl} dp[j - w[i][0]] + v[i][0]\\ dp[j - w[i][0] - w[i][1]] + v[i][0] + v[i][1]\\ dp[j - w[i][0] - w[i][2]] + v[i][0] + v[i][2]\\ dp[j - w[i][0] - w[i][1] - w[i][2]] + v[i][0] + v[i][1] + v[i][2]\\ \end{array} \right.
dp[j]=max⎩
⎨
⎧dp[j−w[i][0]]+v[i][0]dp[j−w[i][0]−w[i][1]]+v[i][0]+v[i][1]dp[j−w[i][0]−w[i][2]]+v[i][0]+v[i][2]dp[j−w[i][0]−w[i][1]−w[i][2]]+v[i][0]+v[i][1]+v[i][2]
代码:
#include<iostream>
using namespace std;
int n,p;
int w[65][3],v[65][3],f[32005];
int main(){
cin >> n >> p;
for(int i = 1; i <= p; i++){
int a,b,c;
cin >> a >> b >> c;
if(c==0){w[i][0]=a,v[i][0]=a*b;}
else
{
if(w[c][1]==0){w[c][1]=a,v[c][1]=a*b;}
else{w[c][2]=a,v[c][2]=a*b;}
}
}
for(int i = 1; i <= p; i++){
for(int j = n; j >= 0; j--){
//状态转移方程
if(j>=w[i][0])f[j]=max(f[j-w[i][0]]+v[i][0],f[j]);
if(j>=w[i][0]+w[i][1])f[j]=max(f[j-w[i][0]-w[i][1]]+v[i][0]+v[i][1],f[j]);
if(j>=w[i][0]+w[i][2])f[j]=max(f[j-w[i][0]-w[i][2]]+v[i][0]+v[i][2],f[j]);
if(j>=w[i][0]+w[i][1]+w[i][2])f[j]=max(f[j-w[i][0]-w[i][1]-w[i][2]]+v[i][0]+v[i][1]+v[i][2],f[j]);
}
}
cout << f[n];
}