背包问题

01背包问题

01背包问题实现代码：

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 100;
const int maxv = 1000;
int w[maxn],c[maxn],dp[maxv];
int main(){
	int n,V;
	scanf("%d%d",&n,&V);
	for(int i = 1;i <= n;i++){
		scanf("%d",&w[i]);
	}
	for(int i = 1;i <=n ;i++){
		scanf("%d",&c[i]);
	}
	for(int v = 0;v <= V;v++){
		dp[v] = 0;
	}
	for(int i =1;i <= n;i++){
		for(int v = V;v >= w[i];v--){
			dp[v] = max(dp[v],dp[v-w[i]] + c[i]);
		}
	}
	int max = 0;
	for(int v = 0;v <= V;v++){
		if(dp[v] > max){
			max = dp[v];
		}
	}
	printf("%d\n",max);
	return 0;
}

完全背包问题

完全背包问题代码：

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 100;
const int maxv = 1000;
int w[maxn],c[maxn],dp[maxv];
int main(){
	int n,V;
	scanf("%d%d",&n,&V);
	for(int i = 1;i <= n;i++){
		scanf("%d",&w[i]);
	}
	for(int i = 1;i <=n ;i++){
		scanf("%d",&c[i]);
	}
	for(int v = 0;v <= V;v++){
		dp[v] = 0;
	}
	for(int i =1;i <= n;i++){
		for(int v = w[i];v <= V;v++){
			dp[v] = max(dp[v],dp[v-w[i]] + c[i]);
		}
	}
	int max = 0;
	for(int v = 0;v <= V;v++){
		if(dp[v] > max){
			max = dp[v];
		}
	}
	printf("%d\n",max);
	return 0;
}