背包问题学习2——hdu1059——思维转换、二进制优化

题目链接
1.思维转换
两个人分的石子重量值相同，等效成一个人分得一半的石子值，瞬间出来了背包问题模板
也就是说有相同量要归到最小规模——便于表示、出思路
2.二进制优化代码模板

int j = 1;
        for (int i = 1; i <= N; i++)
        {
            int temp = 1;
            while (a[i] > temp)
            {
                c[j++] = temp * i;
                a[i] -= temp;
                temp *= 2;
            }
            c[j++] = a[i] * i;
        }

3.题目代码

#include<algorithm>
#include<iostream>
#include<vector>
#include<string>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
const int maxn = 120010;
int c[maxn];
int dp[maxn];
int k = 1;
int main()
{
    int a[10];
    while (cin >> a[1] >> a[2] >> a[3] >> a[4] >> a[5] >> a[6])
    {
        if (a[1] == 0 && a[2] == 0 && a[3] == 0 && a[4] == 0 && a[5] == 0 && a[6] == 0)break;
        int temp = a[1] + a[2] * 2 + a[3] * 3 + a[4] * 4 + a[5] * 5 + a[6] * 6;
        if (temp % 2)
        {
            cout << "Collection #" << k++ << ":" << endl << "Can't be divided." << endl << endl;
            continue;
        }
        int j = 1;
        for (int i = 1; i <= 6; i++)
        {
            int q = 1;
            while (a[i] > q)
            {
                c[j++] = q * i;
                a[i] -= q;
                q *= 2;
            }
            c[j++] = a[i] * i;
        }
        memset(dp, 0, sizeof(dp));
        int n = temp / 2;
        for (int i = 1; i < j; i++)
        {
            for (int m = n; m >= c[i]; m--)
            {
                dp[m] = max(dp[m], dp[m - c[i]] + c[i]);
            }
        }
        if (dp[n] == n)
            cout << "Collection #" << k++ << ":" << endl << "Can be divided." << endl;
        else
            cout << "Collection #" << k++ << ":" << endl << "Can't be divided." << endl;
        cout << endl;
    }
    return 0;
}