poj1276(多重背包模板）

#include<iostream>#include<cstdio>#include<cstring>using namespace std;#define maxn 100005int n,v;int f[maxn];int vl[15],am[15];void zero(int c,int w){    for(int i=v;i>=c;i--)    {        f[i]=max(f[i],f[i-c]+w);    }}void com(int c,int w){    for(int i=c;i<=v;i++)        f[i]=max(f[i],f[i-c]+w);}void mul(int c,int w,int num){    if(c*num>=v) //相当于有无限件    {        com(c,w);        return;    }    for(int k=1;k<num;k=k*2) //将其分成1,2,4...2^(k-1),num-2^k+1件物品    {        zero(k*c,k*w);        num-=k;        //k*=2;    }    zero(num*c,num*w);}int main(){    while(scanf("%d%d",&v,&n)!=EOF)    {        memset(f,0,sizeof(f));        for(int i=1;i<=n;i++)            scanf("%d%d",&am[i],&vl[i]);        for(int i=1;i<=n;i++)            mul(vl[i],vl[i],am[i]);        printf("%d\n",f[v]);    }    return 0;}