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

最新推荐文章于 2019-08-14 11:19:43 发布

Jogging_Clown

最新推荐文章于 2019-08-14 11:19:43 发布

阅读量482

点赞数

分类专栏：动态规划

本文链接：https://blog.csdn.net/yu_ch_sh/article/details/38338085

版权

动态规划专栏收录该内容

194 篇文章 0 订阅

订阅专栏

Charm Bracelet

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 23048		Accepted: 10369

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 W_i (1 ≤ W_i ≤ 400), a 'desirability' factor D_i (1 ≤ D_i ≤ 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: W_i and D_i

Output

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

Sample Input

Sample Output

思路：背包九讲

ac代码

#include<stdio.h>
#include<string.h>
int maxx(int a,int b)
{
	if(a>b)
		return a;
	else
		return b;
}
int dp[200000];
int main()
{
	int m,n;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		int w[100000],d[100000],i,j;
		memset(dp,0,sizeof(dp));
		for(i=0;i<n;i++)
			scanf("%d%d",&w[i],&d[i]);
		for(i=0;i<n;i++)
			for(j=m;j>=w[i];j--)
			{
				dp[j]=maxx(dp[j],dp[j-w[i]]+d[i]);			
			}
		printf("%d\n",dp[m]);
	}
}