算法设计与分析 —— 动态规划解背包问题

问题描述

算法输入为：n维向量w，n维向量v和正整数b
输出为：n+1维向量 optimalWay，其中前n项对应每个物品的装入数量，最后一项为总价值。

//Dynamic planning for Knapasck Problem
#include <vector>
#include <iostream>
#define error -1
#define inf 100000
using namespace std;
class solution
{
	public:
		vector<vector<int>> maxValue; //存放最大值列表
		vector<vector<int>> signFun; //存放标记函数
		solution(int maxItem, int weightLimit)
		{
			vector<int> newArray(weightLimit+1,-1);
			for (int i = 0;i < maxItem+1;i++) //注意这里有个小问题，在创建标记函数表和最大值表的时候，第一个项目对应w[0]但是在表中确实 maxValue[1][y] (y代表限制的重量）
			{
				maxValue.push_back(newArray);
				signFun.push_back(newArray);
			}
		}
};

vector<int> DynamicPlanning(vector<int>value, vector<int>weight, int limitedWeight);

int main()
{
	

	}
	return 0;
}

vector<int> DynamicPlanning(vector<int>value, vector<int>weight, int limitedWeight) //返回向量的最后一项是最大价值的数目
{
	solution solutionList(value.size(), limitedWeight);
	//initialization
	for (int i = 0; i < solutionList.maxValue.size(); i++)
	{
		solutionList.maxValue[i][0] = 0;
		solutionList.signFun[i][0] = 0; //限制钱数为0，装不了，都是0
	}
	for (int i = 0; i < solutionList.maxValue[0].size();i++)
	{
		solutionList.maxValue[0][i] = 0; //一个项目都不考虑，当然也是0
		solutionList.signFun[0][i] = 0; //注意这里有个小问题，标记函数的值为i，表示前i个项目，是从1开始对项目编号，有点失误写的时候
		solutionList.maxValue[1][i] = i / weight[0] * value[0]; // consider only item NO.0 that is the first item
		if (i / weight[0] * value[0] > 0)
			solutionList.signFun[1][i] = 1;
		else
			solutionList.signFun[1][i] = 0;
	}

	for (int i=2;i<solutionList.maxValue.size();i++)
		for (int j = 1; j < solutionList.maxValue[0].size();j++)
		{
			if (j - weight[i - 1] >= 0 && solutionList.maxValue[i - 1][j] <= (solutionList.maxValue[i][j - weight[i - 1]] + value[i - 1]))
			{
				solutionList.maxValue[i][j] = solutionList.maxValue[i][j - weight[i - 1]] + value[i - 1];
				solutionList.signFun[i][j] = i;
			}
			else
			{
				solutionList.maxValue[i][j] = solutionList.maxValue[i - 1][j];
				solutionList.signFun[i][j] = solutionList.signFun[i - 1][j];
			}
		}
	//以下为解的追溯
	vector<int>optimalWay(value.size(),0);
	int x = solutionList.signFun.size() - 1;
	int y = limitedWeight;
	int index = solutionList.signFun[x][y];
	int optimalValue = solutionList.maxValue[x][y];

	while (index)
	{
		optimalWay[index-1]++;
		y = y - weight[index - 1];
		index = solutionList.signFun[index][y];
	}
	optimalWay.push_back(optimalValue); //把最大价值压到返回向量的末尾
	return optimalWay;
}