POJ-3426-0-1背包Charm Bracelet

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 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

4 6

1 4

2 6

3 12

2 7

Sample Output

套用0-1背包的模版即可,这是我写的最快的一次,用了20分钟,并且一次就过了.

dp[i][v]=max{dp[i-1][v],dp[i-1][v-c[i]]+w[i]}

#include<stdio.h>
#include<string.h>
int main()
{int i,N,M,w[3500],D[3500],dp[13000],j;while(scanf("%d%d",&N,&M)!=EOF){memset(dp,0,sizeof(dp));for(i=1; i<=N; i++){scanf("%d%d",&w[i],&D[i]);}for(i=1; i<=N; i++){for(j=M; j>=0; j--){if(j-w[i]>=0)dp[j]=dp[j]>dp[j-w[i]]+D[i]? dp[j]:dp[j-w[i]]+D[i];elsedp[j]=dp[j];}}printf("%d\n",dp[M]);}}

POJ-3426-0-1背包Charm Bracelet相关推荐

【POJ - 3624 】Charm Bracelet （dp，0-1背包裸题）
题干: Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to ...
POJ 3624 Charm Bracelet
DP 一直是心中痛,不多说了,这个暑假就坑在这上了. 这暑假第一道DP题,01背包问题. 题意是说物品有重量和价值 ,但你能承受的重量有限,问你能带的最大价值. 这题数组开大点,尽管不知道有啥坑点, ...
AC日记——[USACO07DEC]手链Charm Bracelet 洛谷 P2871
题目描述 Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like t ...
洛谷——P2871 [USACO07DEC]手链Charm Bracelet
https://www.luogu.org/problem/show?pid=2871 题目描述 Bessie has gone to the mall's jewelry store and spi ...
Charm Bracelet（POJ-3624）
Problem Description Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of cours ...
【Charm Bracelet】题目解析~~
题目: [Charm Bracelet] 有n个物品,编号为i的物品的重量为w[i],价值为c[i],现在要从这些物品中选一些物品装到一个容量为m的背包中,使得背包内物体在总重量不超过m的前提下价值尽 ...
信息学奥赛一本通 1294：Charm Bracelet | OpenJudge NOI 2.6 7113:Charm Bracelet | 洛谷 P2871
[题目链接] ybt 1294:Charm Bracelet OpenJudge NOI 2.6 7113:Charm Bracelet 洛谷 P2871 [USACO07DEC]Charm Brac ...
Charm Bracelet(0-1)
Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fil ...
Charm Bracelet
Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fil ...

POJ-3426-0-1背包Charm Bracelet

POJ-3426-0-1背包Charm Bracelet相关推荐

最新文章

热门文章