![在这里插入图片描述](https://img-blog.csdnimg.cn/20190503193705775.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80NDU3NDUyMA==,size_16,color_FFFFFF,t_70)
Code1:
#include <bits/stdc++.h>
using namespace std;
#define maxn 32110
#define maxm 70
int dp[maxm][maxn],c[maxm],w[maxm],n,m,man[maxm],man_f[maxm][maxm];
inline void init_() {
freopen("a.txt","r",stdin);
}
inline int read_() {
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9') {
if(c=='-') f=-1;
c=getchar();
}
while(c>='0'&&c<='9') {
x=x*10+c-'0';
c=getchar();
}
return x*f;
}
inline void clean_() {
memset(dp,0,sizeof(dp));
memset(man,0,sizeof(man));
memset(man_f,0,sizeof(man_f));
}
inline void readda_() {
n=read_();m=read_();
int x,y,z;
for(int i=1;i<=m;i++) {
x=read_();y=read_();z=read_();
w[i]=x*y;c[i]=x;
if(!z) man[++man[0]]=i;
else man_f[z][++man_f[z][0]]=i;
}
}
inline void work_() {
for(int i=1;i<=man[0];i++) {
for(int j=n;j>=0;j--) {
dp[i][j]=dp[i-1][j];
int last=j-c[man[i]];
if(last>=0) {
dp[i][j]=max(dp[i][j],dp[i-1][last]+w[man[i]]);
}
for(int k=1;k<=man_f[man[i]][0];k++) {
if(last-c[man_f[man[i]][k]]>=0) {
dp[i][j]=max(dp[i][j],dp[i-1][last-c[man_f[man[i]][k]]]+w[man[i]]+w[man_f[man[i]][k]]);
}
}
if(man_f[man[i]][0]==2) {
last=last-c[man_f[man[i]][1]]-c[man_f[man[i]][2]];
if(last>=0) {
dp[i][j]=max(dp[i][j],dp[i-1][last]+w[man[i]]+w[man_f[man[i]][1]]+w[man_f[man[i]][2]]);
}
}
}
}
printf("%d",dp[man[0]][n]);
}
int main() {
readda_();
work_();
return 0;
}
Code2:
#include <bits/stdc++.h>
using namespace std;
#define maxn 32110
#define maxm 70
int dp[maxm][maxn],c[maxm],w[maxm],n,m,man[maxm],man_f[maxm][maxm];
inline void init_() {
freopen("a.txt","r",stdin);
}
inline int read_() {
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9') {
if(c=='-') f=-1;
c=getchar();
}
while(c>='0'&&c<='9') {
x=x*10+c-'0';
c=getchar();
}
return x*f;
}
inline void clean_() {
memset(dp,0,sizeof(dp));
memset(man,0,sizeof(man));
memset(man_f,0,sizeof(man_f));
}
inline void readda_() {
n=read_();m=read_();
int x,y,z;
for(int i=1;i<=m;i++) {
x=read_();y=read_();z=read_();
w[i]=x*y;c[i]=x;
if(!z) man[++man[0]]=i;
else man_f[z][++man_f[z][0]]=i;
}
}
inline void work_() {
for(int i=1;i<=man[0];i++) {
int X=man[i];
int W=w[X],C=c[X];
for(int j=n;j>=0;j--) {
if(j>=C) dp[i][j]=max(dp[i-1][j],dp[i-1][j-C]+W);
else dp[i][j]=max(dp[i-1][j],0);
}
if(man_f[X][0]<1) continue;
C+=c[man_f[X][1]];
W+=w[man_f[X][1]];
for(int j=n;j>=0;j--) {
if(j>=C) dp[i][j]=max(dp[i][j],dp[i-1][j-C]+W);
else dp[i][j]=max(dp[i][j],0);
}
if(man_f[X][0]<2) continue;
C+=c[man_f[X][2]];
W+=w[man_f[X][2]];
for(int j=n;j>=0;j--) {
if(j>=C) dp[i][j]=max(dp[i][j],dp[i-1][j-C]+W);
else dp[i][j]=max(dp[i][j],0);
}
C-=c[man_f[X][1]];
W-=w[man_f[X][1]];
for(int j=n;j>=0;j--) {
if(j>=C) dp[i][j]=max(dp[i][j],dp[i-1][j-C]+W);
else dp[i][j]=max(dp[i][j],0);
}
}
printf("%d",dp[man[0]][n]);
}
int main() {
init_();
readda_();
work_();
return 0;
}