zoukankan      html  css  js  c++  java
  • HDU 2602 Bone Collector(01背包)

    Bone Collector

    Problem Description
    Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave …
    The bone collector had a big bag with a volume of V ,and along his trip of collecting there are a lot of bones , obviously , different bone has different value and different volume, now given the each bone’s value along his trip , can you calculate out the maximum of the total value the bone collector can get ?

     

    Input
    The first line contain a integer T , the number of cases.
    Followed by T cases , each case three lines , the first line contain two integer N , V, (N <= 1000 , V <= 1000 )representing the number of bones and the volume of his bag. And the second line contain N integers representing the value of each bone. The third line contain N integers representing the volume of each bone.
     

    Output
    One integer per line representing the maximum of the total value (this number will be less than 231).
     

    Sample Input
    1 5 10 1 2 3 4 5 5 4 3 2 1
     

    Sample Output
    14

    裸的01背包啦啦啦啦

    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    const int N = 1005;
    int n, v, d[N], val[N], vol[N], cas;
    int main()
    {
        scanf ("%d", &cas);
        while (cas--)
        {
            memset (d, 0, sizeof (d));
            scanf ("%d%d", &n, &v);
            for (int i = 1; i <= n; ++i)
                scanf ("%d", &val[i]);
            for (int i = 1; i <= n; ++i)
            {
                scanf ("%d", &vol[i]);
                for (int j = v; j >= vol[i]; --j)
                    d[j] = max (d[j], d[j - vol[i]] + val[i]);
            }
            printf ("%d
    ", d[v]);
        }
        return 0;
    }
    


  • 相关阅读:
    Python爬虫之路——简单的网页抓图
    vim修复,telnet安装启动,linux更新软件源
    用博客记录成长的历程
    CleanCode代码整洁之道培训总结(2015-03-14)
    MySQL 登录问题
    LeetCode——Set Matrix Zeroes
    CSS vertical-align属性的使用方法
    电子商务站点设计分析--首屏设计
    easyUI资料学习资料
    java实现DES加密与解密,md5加密
  • 原文地址:https://www.cnblogs.com/acvay/p/3947297.html
Copyright © 2011-2022 走看看