hdu2844 完全背包和多重背包的结合

之前没有注意到完全背包的情况,一直TLE

题意:给定硬币,求出能组成多少种钱

//完全背包复杂度O(n*v),多重背包为O(n*v*log(num[i])),01背包为O(n*v);#include<iostream>#include<cstdio>#include<cmath>using namespace std;int dp[100000];int a[100],c[100];int n,m;int max(int a,int b){return a>b?a:b;}int min(int a,int b){return a>b?b:a;}void solve(int sum,int weight,int value){for(int i=sum;i>=weight;i--)dp[i]=max(dp[i],dp[i-weight]+value);}void complete(int cost, int weight,int sum) { for(int i = cost; i <= sum; i++) if(dp[i] < dp[i - cost] + weight) dp[i] = dp[i - cost] + weight; } int main(){while(scanf("%d%d",&n,&m)!=EOF&&!(n==0&&m==0)){int i,j;int sum=0;for(i=0;i<n;i++)scanf("%d",&a[i]);for(j=0;j<n;j++)scanf("%d",&c[j]);memset(dp,0,sizeof(dp));for(i=0;i<n;i++){if(c[i]*a[i]>m)complete(a[i],a[i],m); //为完全背包else{j=1;while(j<c[i]){solve(m,j*a[i],j*a[i]);c[i]-=j;j<<=1;}solve(m,c[i]*a[i],c[i]*a[i]);}}int ans=0;for(i=1;i<=m;i++)if(dp[i]==i)ans++;printf("%d/n",ans);}return 0;}