zoukankan      html  css  js  c++  java
  • HDU-2844-Coins(多重背包)

    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
     

    Source
     

    思路:经典背包问题。

    #include <cstdio>
    #include <algorithm>
    using namespace std;
    
    int d[105],c[105],dp[100005];
    
    int main()
    {
        int n,m,i,j,k,ans;
    
        while(~scanf("%d%d",&n,&m) && n+m)
        {
            for(i=0;i<n;i++) scanf("%d",&d[i]);
            for(i=0;i<n;i++) scanf("%d",&c[i]);
    
            for(i=0;i<=m;i++) dp[i]=0;
    
            for(i=0;i<n;i++)
            {
                if(d[i]*c[i]>=m)
                {
                    for(j=d[i];j<=m;j++) dp[j]=max(dp[j],dp[j-d[i]]+d[i]);
                }
                else
                {
                    k=1;
    
                    while(((k<<1)-1)<=c[i])
                    {
                        for(j=m;j>=k*d[i];j--) dp[j]=max(dp[j],dp[j-k*d[i]]+k*d[i]);
    
                        k<<=1;
                    }
    
                    if(k-1<c[i])
                    {
                        k=(c[i]-k+1)*d[i];
    
                        for(j=m;j>=k;j--) dp[j]=max(dp[j],dp[j-k]+k);
                    }
                }
            }
    
            ans=0;
    
            for(i=1;i<=m;i++) if(dp[i]==i) ans++;
    
            printf("%d
    ",ans);
        }
    }
  • 相关阅读:
    调整数组顺序使奇数位于偶数前面
    数值的整数次方
    矩形覆盖
    变态跳台阶
    跳台阶
    ubuntu图形界面切换文字界面(文字界面切换图形界面)
    Django环境安装、虚拟机端口映射、pycharm远程配置
    sql注入(一)-----数字型
    mysql基本语法
    渗透测试之------信息收集
  • 原文地址:https://www.cnblogs.com/lcchuguo/p/4042243.html
Copyright © 2011-2022 走看看