代码:
#include <iostream>
using namespace std;
const int Max_weight = 10; //最大重量
int v[] = { 0,1,3,5,9 }; //保存第i个物品的价值
int w[] = { 0,2,3,4,7 }; //保存第i个物品的重量
int dp[Max_weight+1][Max_weight + 1]; //优化函数
void TrackSolution()
{
for (int i = 0; i < Max_weight; i++)
dp[1][i] = w[0] < i ? v[0] : 0;
for (int i = 1; i <= 4; i++)
{
for (int j = 0; j <= Max_weight; j++)
{
dp[i][j] = dp[i - 1][j];
if (w[i] <= j) //放第i个物品不超重时
{
if (dp[i][j] < dp[i - 1][j - w[i]] + v[i])
dp[i][j] = dp[i - 1][j - w[i]] + v[i];
}
}
}
cout << dp[4][10] << endl;