POJ

来源：互联网发布：c语言中char的意思编辑：程序博客网时间：2024/06/07 00:16

题意：要取价值为cash的钱，ATM机里面有N种面额的钱，每种面额为Ni，数量为Di，问最多能取出多少钱（要小于等于cash）；
思路：以cash为背包容量，多重背包

#include<iostream>#include<algorithm>#include<string>#include<cstring>#include<map>#include<queue>#include<cmath>#include<stack>#include<vector>#include<cstdio>#define MAXN 33000#define INF 0x3f3f3f3f#define lmid l,m,rt<<1#define rmid m+1,r,rt<<1|1#define ls rt<<1#define rs rt<<1|1#define Mod 1000000007#define i64 __int64#define LIMIT_ULL 100000000000000000using namespace std;int dp[100005];int a[15],b[15];void dc(int v,int w,int sum){     if(w*v>=sum)     {          for(int i=w;i<=sum;i++)               dp[i]=max(dp[i],dp[i-w]+w);     }     else     {          int k=1;          while(k<v)          {               for(int i=sum;i>=k*w;i--)                    dp[i]=max(dp[i],dp[i-k*w]+k*w);               v-=k;               k*=2;          }          for(int i=sum;i>=v*w;i--)               dp[i]=max(dp[i],dp[i-v*w]+v*w);     }}int main(){     int m;     while(scanf("%d",&m)==1)     {          int n;          scanf("%d",&n);          for(int i=0;i<n;i++)               scanf("%d%d",&a[i],&b[i]);          memset(dp,0,sizeof(dp));          for(int i=0;i<n;i++)               dc(a[i],b[i],m);          cout<<dp[m]<<endl;     }}

阅读全文

0 0