NASA的食物计划--01背包

版权声明：转载请附上地址 https://blog.csdn.net/weixin_44574520/article/details/89815056

luogu 1507

Code:

#include <bits/stdc++.h>
using namespace std;
#define maxV 410
#define maxM 410
#define maxn 60

int V,M,n,v[maxn],m[maxn],k[maxn];

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 readda_() {
	V=read_();M=read_();
	n=read_();
	for(int i=1;i<=n;i++) {
		v[i]=read_();m[i]=read_();k[i]=read_();
	}
}

int f[maxV][maxM];

inline void work_() {
	memset(f,0,sizeof(f));
	for(int i=1;i<=n;i++) {
		for(int j=V;j>=0;j--) {
			for(int p=M;p>=0;p--) {
				if(j>=v[i]&&p>=m[i]) f[j][p]=max(f[j][p],f[j-v[i]][p-m[i]]+k[i]);
				else f[j][p]=max(f[j][p],0);
			}
		}
	}
	printf("%d",f[V][M]);
}

int main() {
	init_();
	readda_();
	work_();
	return 0;
}