01背包--POJ3624

Charm Bracelet
Description

Bessie has gone to the mall’s jewelry store and spies a charm bracelet. Of course, she’d like to fill it with the best charms possible from the N (1 ≤ N ≤ 3,402) available charms. Each charm i in the supplied list has a weight Wi (1 ≤ Wi ≤ 400), a ‘desirability’ factor Di (1 ≤ Di ≤ 100), and can be used at most once. Bessie can only support a charm bracelet whose weight is no more than M (1 ≤ M ≤ 12,880).

Given that weight limit as a constraint and a list of the charms with their weights and desirability rating, deduce the maximum possible sum of ratings.

Input

• Line 1: Two space-separated integers: N and M
• Lines 2…N+1: Line i+1 describes charm i with two space-separated integers: Wi and Di

Output

• Line 1: A single integer that is the greatest sum of charm desirabilities that can be achieved given the weight constraints

Sample Input

4 6
1 4
2 6
3 12
2 7
Sample Output

23

本题是典型的01背包问题
01背包问题典型表述
有N件物品和一个容量为V的背包。第i件物品价值是从c【i】,体积为w【i】，求解将那些物品装入背包可使价值之和最大。
状态转移方程
f[i][v]=max([f[i-1][v], f[i-1][v-c[i]]+w[i]。
具体讲解查看百科，此处不再赘述
https://baike.so.com/doc/6953377-7175784.html

AC代码

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;

int f[12890];
int wi[3403], di[3403];

int main()
{
	for (int j = 0; j < 12890; j++)
	{
		f[j] = 0;
	}
	for (int i = 0; i < 3403; i++)
	{
		wi[i] = 0;
		di[i] = 0;
	}

	int n, m;
	cin >> n >> m;

	for (int i = 1; i <= n; i++)
	{
		cin >> wi[i] >> di[i];
	}

	for (int i = 1; i <= n; i++)
	{
		for (int w = m; w >= 0; w--)
		{
			if (w - wi[i] >= 0)
				f[w] = max(f[w], f[w - wi[i]] + di[i]);
			else
				f[w] = f[w];
		}
	}

	int max = 0;
	for (int i = 0; i <= m; i++)
	{
		if (f[i] > max)
			max = f[i];
	}
	cout << max << endl;
	return 0;
}