笔记:
代码:
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1001;
int w[5] = { 0 , 2 , 3 , 4 , 5 };
int v[5] = { 0 , 3 , 4 , 5 , 6 };
int dp[4][4] = { 0 };
int n = 4;
int capacity = 8;
int main()
{
for (int i = 1; i <=n; i++)
{
for (int j = 1; j <= capacity; ++j)
{
if (w[i] > j)
dp[i][j] = dp[i - 1][j];
else
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - w[i]] + v[i]);
}
}
for (int i = 0; i <= n; ++i)
{
for (int j = 0; j <= capacity; ++j)
{
cout << dp[i][j] << ' ';
}
cout << endl;
}
return 0;
}
运行结果: