POJ1014Dividing（DP）

http://poj.org/problem?id=1014

最简单之多重背包

#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 0x3f3f3f3f
#define MAX(a,b) (a > b ? a : b)
#define MIN(a,b) (a < b ? a : b)
#define mem0(a) memset(a,0,sizeof(a))

typedef long long LL;
const double eps = 1e-12;
const int MAXN = 1005;
const int MAXM = 5005;

int num[7], DP[60005], F;

void ZeroOnePack(int v)
{
    for(int i=F;i>=v;i--)
    {
        DP[i] = max(DP[i], DP[i-v]+v);
    }
}

void CompletePack(int v)
{
    for(int i=v;i<=F;i++)
    {
        DP[i] = max(DP[i], DP[i-v]+v);
    }
}

int ComplexPack()
{
    for(int i=1;i<=6;i++)
    {
        if(num[i]*i >= F) CompletePack(i);
        else
        {
            int k = 1;
            while(k <= num[i])
            {
                ZeroOnePack(k*i);
                num[i] -= k;
                k *= 2;
            }
            ZeroOnePack(num[i]*i);
        }
    }
    return DP[F];
}

int main()
{
    int T=0;
    while(scanf("%d%d%d%d%d%d", &num[1],&num[2],&num[3],&num[4],&num[5],&num[6]))
    {
        if(!(num[1]||num[2]||num[3]||num[4]||num[5]||num[6])) break;
        F = 0; mem0(DP);
        for(int i=1;i<=6;i++) F += num[i]*i;
        printf("Collection #%d:
", ++T);
        if(F & 1) {printf("Can't be divided.

"); continue;}
        F /= 2;
        printf("%s

", ComplexPack()==F?"Can be divided.":"Can't be divided.");
    }
    return 0;
}