POJ 1742（特别技巧之多重背包转完全背包)

Farmer John has gone to town to buy some farm supplies. Being a very efficient man, he always pays for his goods in such a way that the smallest number of coins changes hands, i.e., the number of coins he uses to pay plus the number of coins he receives in change is minimized. Help him to determine what this minimum number is.

FJ wants to buy T (1 ≤ T ≤ 10,000) cents of supplies. The currency system has N (1 ≤ N ≤ 100) different coins, with values V₁, V₂, ..., V_N (1 ≤ V_i ≤ 120). Farmer John is carrying C₁ coins of value V₁, C₂ coins of value V₂, ...., and C_N coins of value V_N (0 ≤ C_i ≤ 10,000). The shopkeeper has an unlimited supply of all the coins, and always makes change in the most efficient manner (although Farmer John must be sure to pay in a way that makes it possible to make the correct change).

Input

Line 1: Two space-separated integers:  N and  T. 
Line 2: N space-separated integers, respectively  V ₁,  V ₂, ...,  V_N coins ( V ₁, ... V_N) 
Line 3: N space-separated integers, respectively  C ₁,  C ₂, ...,  C_N

Output

Line 1: A line containing a single integer, the minimum number of coins involved in a payment and change-making. If it is impossible for Farmer John to pay and receive exact change, output -1.

Sample Input

3 70
5 25 50
5 2 1

Sample Output

3

Hint

Farmer John pays 75 cents using a 50 cents and a 25 cents coin, and receives a 5 cents coin in change, for a total of 3 coins used in the transaction.

下面是我自己写的代码从状态0出发看能到达哪些状态，最后把所有的状态种数输出就行

#include <stdio.h>
#include<algorithm>
#include<cstring>
#include<cmath>
#define M 100001
int dp[M];
inline int max(int a,int b)
{
    return a>b?a:b;
}
int main()
{
    //freopen("input.txt","r",stdin);
    int n,m;
    while(~scanf("%d%d",&n,&m)&&(m+n))
    {
        int a[101],c[101];
        int f=0;
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=n;i++)scanf("%d",a+i);
        for(int i=1;i<=n;i++)scanf("%d",c+i);
        dp[0]=1;
        for(int i=1;i<=n;i++)
        {
            if(a[i]*c[i]>=m)
            {
                for(int j=a[i];j<=m;j++)
                if(!dp[j]&&dp[j-a[i]])dp[j]=1;
            }
            else
            {
                int k=1;
                while(k<c[i])
                {
                    for(int j=m;j>=k*a[i];j--)
                        if(!dp[j]&&dp[j-k*a[i]])dp[j]=1;
                    c[i]-=k;
                    k<<=1;
                }
                for(int j=m;j>=c[i]*a[i];j--)
                    if(!dp[j]&&dp[j-c[i]*a[i]])dp[j]=1;
            }
        }
        for(int j=1;j<=m;j++)
            if(dp[j])f++;
        printf("%d\n",f);
    }
    return 0;
}

下面是某大牛写的，把多重背包转化成完全背包，时间就优化了不少。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAX = 1e5+10;
int use[MAX]; int dp[MAX];
int a[MAX],b[MAX];
int main()
{

    int n,m,ans;
    while(scanf("%d %d",&n,&m)==2&&(n||m))
    {
        for(int i=0;i<n;i++) scanf("%d",&a[i]);
        for(int i=0;i<n;i++) scanf("%d",&b[i]);
        memset(dp,0,sizeof(dp)); dp[0]=1; ans=0;
        for(int i=0;i<n;i++)
        {
            memset(use,0,sizeof(use));
            for(int j=a[i];j<=m;j++)
            {
                if(!dp[j]&&dp[j-a[i]]&&use[j-a[i]]<b[i])
                {
                    dp[j]=1; ans++; use[j]=use[j-a[i]]+1;
                }
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}