计蒜客 平分娃娃（DP）

平分娃娃

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>

#define maxn 100
#define maxv 200000
using namespace std;

bool dp[maxn][maxv];
int values1[maxn];
int nums1[maxn];
int values2[maxn];
int nums2[maxn];
int len;

int main()
{
    //freopen("data.in","r",stdin);
    ios::sync_with_stdio(false);

    memset(values1,0,sizeof(values1));
    memset(nums1,0,sizeof(nums1));
    memset(values2,0,sizeof(values2));
    memset(nums2,0,sizeof(nums2));
    memset(dp, false, sizeof(dp));

    long long  sum = 0;
    for (int i = 1; i <= 6; i++)
    {
        cin >> nums1[i];
        values1[i] = i;
        sum += nums1[i] * values1[i];
    }

    if(sum % 2 == 1) {
        cout << "Can't be divided." << endl;
        return 0;
    }

    //拆背包
    len = 0;
    for(int i = 1; i <= 6; i++) {
        int c = nums1[i];
        for(int k = 1; k <= c; k = k * 2) {
            ++len;
            values2[len] = k * values1[i];
            c -= k;
        }

        if(c > 0) {
            ++len;
            values2[len] = c * values1[i];
        }
    }

    //转换成 0-1背包
    dp[0][0] = true;
    for(int i = 1; i <= len; ++i) {
        for(int j = 0; j <= sum/2; ++j) {
            dp[i][j] = dp[i-1][j];//不放
            //可以放
            if(j >= values2[i]) {
                dp[i][j] |= dp[i-1][j - values2[i]];
            }
        }
    }

    if(dp[len][sum/2]) {
        cout << "Can be divided." << endl;
    } else {
        cout << "Can't be divided." << endl;
    }

    return 0;
}