POJ 3624 Charm Bracelet（动态规划：01背包问题）

题目描述：

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

题意描述：承重m的背包，有n个物品，第i个物品重w[i],价值v[i],求背包能装入物品的最大价值。

分析：dp状态：不选第i个物品时背包时所拥有的价值，与选第i个物品时背包所拥有的价值比较。dp[j]=max(dp[[j].dp[j-w[i]]+v[i])

代码如下：

#include<stdio.h>
int max(int a,int b)//自定义比较大小函数 
{
	if(a>b)
	return a;
	else
	return b;
}
int main()
{
	int n,m,i,j;
	int w[3405];
	int v[3405];
	int dp[12900]={0};//初始化状态 
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++)
	{
		scanf("%d%d",&w[i],&v[i]);
	}
	for(i=1;i<=n;i++)//循环n件物品
	{
		for(j=m;j>=w[i];j--)//不断比较加上第i件物品与不加上第i件物品的价值，两者值较大的赋值给dp[j]
		{
			dp[j]=max(dp[j],dp[j-w[i]]+v[i]);
		}
	}
	printf("%d\n",dp[m]);//dp[m]为能装的最大重量 
	return 0; 
}