POJ 1276 : Cash Machine - 多重背包

最基础的多重背包

#include<iostream>#include<cstdio>#include<cstring>using namespace std;const int N=100005;int cash,k,n[N],w[N],c[N],dp[N],cnt[N]; //cnt[]限制取bills的个数int main(){int i,j;while(~scanf("%d%d",&cash,&k)){for(i=0;i<k;i++){scanf("%d%d",&n[i],&w[i]);c[i]=w[i];//此处体积c[i]与价值w[i]相同}memset(dp,0,sizeof(dp));for(i=0;i<k;i++){memset(cnt,0,sizeof(cnt));for(j=w[i];j<=cash;j++){if(dp[j]<dp[j-c[i]]+w[i] && cnt[j-c[i]]<n[i]){dp[j]=dp[j-c[i]]+w[i];cnt[j]=cnt[j-c[i]]+1;}}}printf("%d\n",dp[cash]);}return 0;}