hdu1059 Dividing ——多重背包

link:http://acm.hdu.edu.cn/showproblem.php?pid=1059

最简单的那种

 #include <iostream>
 #include <cstdio>
 #include <cstdlib>
 #include <cstring>
 #include <cmath>
 #include <cctype>
 #include <algorithm>
 #include <queue>
 #include <deque>
 #include <queue>
 #include <list>
 #include <map>
 #include <set>
 #include <vector>
 #include <utility>
 #include <functional>
 #include <fstream>
 #include <iomanip>
 #include <sstream>
 #include <numeric>
 #include <cassert>
 #include <ctime>
 #include <iterator>
 const int INF = 0x3f3f3f3f;
 const int dir[][] = {{-,},{,},{,-},{,},{-,-},{-,},{,-},{,}};
 using namespace std;
 int V,m[],c[],w[],f[];
 void zeropack(int c, int w)
 {
     for (int v=V;v>=c;--v) f[v]=max(f[v],f[v-c]+w);
     return;
 }
 void completepack(int c,int w)
 {
     for(int v=c;v<=V;++v) f[v]=max(f[v],f[v-c]+w);
     return;
 }
 void multipack(int c,int w,int m)
 {
     if(c*m>=V)
     {
         completepack(c,w); return;
     }
     int k=;
     while (k<m)
     {
         zeropack(k*c,k*w); m-=k; k*=;
     }
     zeropack(c*m,w*m);
     return;
 }
 int main(void)
 {
     ios::sync_with_stdio(false);
     #ifndef ONLINE_JUDGE
     freopen("in.txt", "r", stdin);
     #endif // ONLINE_JUDGE
     int t=; for(int i=;i<;++i) c[i]=w[i]=i+;
     while ()
     {
         int sum=;
         for(int i=;i<;++i) cin>>m[i], sum+=m[i]*(i+);
         if(!sum) break;
 //        if(t!=1) cout<<endl;
         cout<< "Collection #"<<t<<":\n";
         t++;
         if(sum&) {cout<< "Can't be divided."<<endl<<endl; continue;}
         V=sum/;
         memset(f,-INF,sizeof(f)); f[]=;
         for(int i=;i<;++i) multipack(c[i],w[i],m[i]);
         if(f[V]<) cout<< "Can't be divided."<<endl;
         else cout<< "Can be divided."<<endl;
         cout<<endl;
     }
     return ;
 }

其实还是要理解一下这个思想……
不能单靠记忆