zoukankan      html  css  js  c++  java
  • 【题解】coin HDU2884 多重背包

    题目

    Coins

    Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 12330 Accepted Submission(s): 4922

    Problem Description

    Whuacmers use coins.They have coins of value A1,A2,A3…An Silverland dollar. One day Hibix opened purse and found there were some coins. He decided to buy a very nice watch in a nearby shop. He wanted to pay the exact price(without change) and he known the price would not more than m.But he didn’t know the exact price of the watch.

    You are to write a program which reads n,m,A1,A2,A3…An and C1,C2,C3…Cn corresponding to the number of Tony’s coins of value A1,A2,A3…An then calculate how many prices(form 1 to m) Tony can pay use these coins.

    Input

    The input contains several test cases. The first line of each test case contains two integers n(1 ≤ n ≤ 100),m(m ≤ 100000).The second line contains 2n integers, denoting A1,A2,A3…An,C1,C2,C3…Cn (1 ≤ Ai ≤ 100000,1 ≤ Ci ≤ 1000). The last test case is followed by two zeros.

    Output

    For each test case output the answer on a single line.

    Sample Input

    3 10
    1 2 4 2 1 1
    2 5
    1 4 2 1
    0 0
    

    Sample Output

    8
    4
    

    题意:Tony想要买一个东西,他只有n中硬币每种硬币的面值为a[i]每种硬币的数量为c[i]要买的物品价值不超过m

    输入:第一行输入n和m,第二行输入n个硬币的面值和n个硬币的数量,输入0 0结束

    输出:1到m之间有多少价格Tony可以支付

    分析

    一道多重背包

    #include<cstdio>
    #include<iostream>
    #include<cstring>
    #include<algorithm>
    #include<cmath>
    #define ll long long
    #define re register int
    #define fp(i,a,b) for(re i=a,I=b;i<=I;++i)
    #define fd(i,a,b) for(re i=a,I=b;i>=I;--i)
    #define file(s) freopen(s".in","r",stdin),freopen(s".out","w",stdout);
    using namespace std;
    const int INF=0x7fffff;
    inline int read() {
        int x=0,w=1;
        char ch=getchar();
        while(ch!='-'&&(ch<'0'||ch>'9')) ch=getchar();
        if(ch=='-') w=-1,ch=getchar();
        while(ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+ch-48,ch=getchar();
        return x*w;
    }
    int a[100+10],c[100+10],f[10000];
    
    void Obag(int m,int v,int w) {                                            //0-1背包 m背包的总容量、v物品的体积、w物品的价值
        for(int i=m; i>=v; i--)
            f[i]=max(f[i],f[i-v]+w);
    }
    
    void Cbag(int m,int v,int w) {                                           //完全背包 m背包的总容量、v物品的体积、w物品的价值
        for(int i=v; i<=m; i++)
            f[i]=max(f[i],f[i-v]+w);
    }
    
    void Mbag(int m,int v,int w,int num) {                                  //多重背包 m背包的总容量、v物品的体积、w物品的价值、num物品的数量
        if(v*num>=m) {
            Cbag(m,v,w);
            return ;
        }
        int k=1;
        for(k=1; k<=num; k<<=1) {
          Obag(m,k*v,k*w);
          num=num-k;
        }
        if(num)
            Obag(m,num*v,num*w);
    }
    
    int main() {
        //file("s");
        int n,m;
        n=read();
        m=read();
        while(n||m) {
            fp(i,1,n) a[i]=read();
            fp(i,1,n) c[i]=read();
            fp(i,1,m) f[i]=-INF;
            f[0]=0;
            fp(i,1,n) {
                Mbag(m,a[i],a[i],c[i]);
            }
            fp(i,1;m) if(f[i]>0) sum++;
            cout<<sum<<endl;
        }
        return 0;
    }
    
  • 相关阅读:
    一个布局里面引用另一个布局的控件
    字符串的操作
    代码中使用bitmap资源并加载到控件上
    ui主线程控件的更新就让这个activity的异步任务做完整
    java语法:字符串数组的赋值
    文件路径的格式
    Android布局及属性归总(查询用)
    代码里语句的顺序狠重要。。。
    社交里互评、点赞的实现
    小功能——类似微信里,评论内容里面,点击每个人的用户名进入个人主页
  • 原文地址:https://www.cnblogs.com/bbqub/p/7710007.html
Copyright © 2011-2022 走看看