POJ-3624 Charm Bracelet （01背包入门题）

最新推荐文章于 2019-08-25 16:44:00 发布

Borrrrrrrrrrrram

最新推荐文章于 2019-08-25 16:44:00 发布

阅读量482

点赞数

分类专栏：动态规划-背包文章标签： poj 01背包 acm 动态规划

本文链接：https://blog.csdn.net/hmc0411/article/details/78361701

版权

动态规划-背包专栏收录该内容

28 篇文章 0 订阅

订阅专栏

Charm Bracelet

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 41474		Accepted: 18019

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

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int dp[12888];
int main(){
    memset(dp, 0, sizeof(dp));
    int n, m, w, d;
    scanf("%d %d", &n, &m);
    for(int i = 1; i <= n; ++i){
        scanf("%d %d", &w, &d);
        for(int j = m; j >= w; --j){
            dp[j] = max(dp[j], dp[j - w] + d);
        }
    }
    printf("%d\n", dp[m]);
}

/*
题意：3402个charms，每个charm重量1~400,价值1~100,最多用一次。charms重量最大不超过
m的情况下，价值和最大可以为多少。

思路：
裸的背包，dp[i]表示使用i个单位的重量最大可以得到多少价值的charm。
dp方程很容易转移：dp[j] = max(dp[j], dp[j - w] + d);
最后答案就是dp[m]，m是重量限制。
*/