暑假集训第四周周三赛 E - Charm Bracelet 最大魅力

最新推荐文章于 2017-07-24 08:05:26 发布

linyuxilu

最新推荐文章于 2017-07-24 08:05:26 发布

阅读量319

点赞数

分类专栏：动态规划文章标签：动态规划

本文链接：https://blog.csdn.net/linyuxilu/article/details/47304305

版权

动态规划专栏收录该内容

67 篇文章 0 订阅

订阅专栏

E - Charm Bracelet

Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u

Submit Status Practice POJ 3624

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

分析：

这是一道最简单的动规，有专门的模板，今天才知道，我用的叫做滚动数组，挺高大上一个名字

他有专门的状态转移方程：

if(f[j]<f[j-a[i]]+b[i])
        f[j]=f[j-a[i]]+b[i];

#include<stdio.h>
#include<string.h>
int main()
{
    int n,m,a[3500],b[35000],f[13000],i,j,s;
    scanf("%d%d",&n,&m);
    memset(f,0,sizeof(f));
    for(i=0;i<n;i++)
        scanf("%d %d",&a[i],&b[i]);
    for(i=0;i<n;i++)
        for(j=m;j>=a[i];j--)
        if(f[j]<f[j-a[i]]+b[i])
        f[j]=f[j-a[i]]+b[i];
        printf("%d\n",f[m]);
}