E - 01背包

最新推荐文章于 2024-01-26 18:29:06 发布

sdifv

最新推荐文章于 2024-01-26 18:29:06 发布

阅读量260

点赞数

分类专栏： # 专题

本文链接：https://blog.csdn.net/HYH863677698/article/details/79339321

版权

专题专栏收录该内容

14 篇文章 0 订阅

订阅专栏

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

Iutput

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

思路：

题意：大家很熟悉的01背包问题；
要求用动规来做，所以可以把问题分解成背包容量为n时所能装下的最大的价值 c[j]=max(c[j],c[j-w[i]]+p[i]);

代码

#include<cstdio>
using namespace std;
int max(int x,int y)
{
    return x>y?x:y;
}
int main()
{
    int n,m,i,j;
    int w[4000],p[4000];
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        int c[20000]={0};//赋零值，下面比较用
        for(i=1;i<=n;i++)
            scanf("%d%d",&w[i],&p[i]);
        for(i=1;i<=n;i++)//循环n件物品
            for(j=m;j>=w[i];j--)//循环重量，0到m，不断比较加上第i件物品
                                //与不加上第i件物品的价值，值大的赋值给c[j]
                c[j]=max(c[j],c[j-w[i]]+p[i]);
        printf("%d\n",c[m]);
    }
    return 0;
}