0-1背包问题

主要是这里的递归公式，用括号括起来的就是

#include<iostream>
#include<vector>
using namespace std;
int B[6][21] = { 0 };

int W[6] = { 0, 2, 3, 4, 5, 9 };
int V[6] = { 0, 3, 4, 5, 8, 10 };

void func()
{
	for (int i = 1; i < 6; ++i)
	{
		for (int j = 1; j < 21; ++j)
		{
			if (W[i] > j)
			{
				B[i][j] = B[i - 1][j];
			}
			else
			{
				int val1 = B[i - 1][j - W[i]] + V[i];
				int val2 = B[i - 1][j];
				if (val1 > val2)
					B[i][j] = val1;
				else
					B[i][j] = val2;
			}
		}
	}
}

int main()
{
	func();
	cout << B[5][20];
	/*for (int i = 0; i < 6; ++i)
	{
		for (int j = 0; j < 21; ++j)
			cout << B[i][j]<<"   ";
		cout << endl;

	}*/
	return 0;
}