动态规划——0-1背包问题
问题描述
设计与实现求解0-1背包问题的动态规划算法;
0-1背包问题:给定n个重量为w1,w2,w3…wn,价值为v1,v2,v3…vn的物品和容量为C的背包,求这个物品中一个最有价值的子集,使得在满足背包的容量的前提下,包内的总价值最大
解决思路
算法表述
算法knapsack_dy
输入:物品重量表weight[n]、物品价值表value[n]、物品个数n、背包容量n
输出:最大价值
①for i=0 to limit do
② if weight[0] <= i then m[0][i] = value[0]
③ else m[0][i] = 0
④for i = 1 to n do
⑤ for j = 0 to limit do
⑥ m[i][j] = m[i-1][j]
⑦ if weight[i] <= j then m[i][j] = max{m[i][j],m[i-1][j-weight[i]]+value[i]}
⑧return m[i-1][limit]
算法代码
获得最大价值的动态规划算法:
int knapsack_dy(int weight[], int value[], int n, int limit)
{
for (int i = 0; i <= limit; i++)
m[0][i] = weight[0] <= i ? value[0] : 0;
for (int i = 1; i < n; i++)
for (int j = 0; j <= limit; j++)
{
if (weight[i] > j) m[i][j] = m[i - 1][j];
else m[i][j] = max(m[i - 1][j], value[i] + m[i - 1][j - weight[i]]);
}
return m[n - 1][limit];
}
输出物品放置方案的代码:
void print(int weight[], int value[], int n,int limit)
{
int i = n - 1;
int j = limit;
while (i >= 0)
{
if (m[i][j] == m[i - 1][j - weight[i]] + value[i])
{
cout << i + 1 << " ";
j -= weight[i];
}
i--;
}
cout << endl;
}