有兴趣的来康康背包问题

我认为背包问题简短的核心思路就分为两种

二维数组

#include<iostream>

#include<vector>

#include<algorithm>

Using namespace std;

Int main(){

vector<int> weight ={1,2,3,4};

vector<int> value ={2,4,4,5};

int bagWeight = 5;

vector<vector<int>>dp(weight.size(0,vector<int>(bagWeight + 0));

for(int j =bagWeight;j>=weight[0];j--){

dp[0][j] = dp[0][j-weight[0]]+ value[0];

for(int I =1;i<weight.size();i++){//遍历物品

for(int j =1;j<=bagweight;j++){//遍历背包容量

if(j<weight[i])

else

dp[i][j] = max(dp[i-1][j],dp[i-1][j-weight[i]]+value[i]);

}

}

cout<<dp[weight.size()-1][bagWeight]<<endl;

Return 0;

}

一维数组

Int main(){

vector<int> weight ={1,2,3,4};

vector<int> value ={2,4,4,5};

int bagWeight = 5;

vector<int> dp(bagWeight+1,0);

for(int I =0;i<weight.size();i++){

for(int j =bagWeight;j>=weight[i];j--){

dp[j] =max(dp[j],dp[j-weight[i]] + value[i]);

}

}

cout<<dp[bagWeight]<<endl;

return 0;

}

至于什么叫做背包问题 和具体的构思思路 我强烈推荐大家看一下这个链接

(15条消息) C++ 背包问题_c++背包问题_大庆指针的博客-优快云博客