[HDU 1171]Big Event in HDU 母函数或多重背包

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

题意：杭电计算机学院分家，需要把东西分成两份，要求两份的价值最接近。先输入物品数量 n 表示有 n 个物品, 然后输入每个物品价值和数量。比较坑的地方就是输入负数结束。

思路：母函数或者多重背包

母函数代码（514ms）：

#include <cstdio>
#include <cstring>
#include <iostream>

using namespace std;

int val[55],counts[55];
int nex[125005], temp[125005];

int main()
{
    int n;
    while(cin>>n && n >= 0)
    {
        int sum = 0;
        for(int i = 0; i < n; i++){
            cin>>val[i]>>counts[i];
            sum += val[i]*counts[i];
        }
        int avg = sum / 2;
        memset(nex, 0, sizeof(nex));
        memset(temp, 0, sizeof(temp));
        for(int i = 0; i <= counts[0]; i++){
            nex[i * val[0]] = 1;
        }
        int len = val[0] * counts[0];
        for(int i = 1; i < n; i++){
            for(int j = 0; j <= len && j <= avg; j++){
                for(int k = 0; k <= val[i]*counts[i] && j+k <= avg; k += val[i]){
                    temp[j+k] += nex[j];
                }
            }
            len += val[i]*counts[i];
            for(int j = 0; j <= len && j <= avg; j++){
                nex[j] = temp[j];
                temp[j] = 0;
            }
        }
        for(int i= avg; i >= 0; i--){
            if(nex[i] != 0){
                cout<<sum-i<<" "<<i<<endl;
                break;
            }
        }
    }
    return 0;
}

多重背包（93ms）：

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

using namespace std;

int dp[125005];

void ZeroOnePack(int volume, int val, int vol)
{
    for(int i = volume; i >= vol; i--){
        dp[i] = dp[i-vol] + val;
    }
}

void CompletelyPack(int volume, int val, int vol)
{
    for(int i = vol; i <= volume; i++){
        dp[i] = dp[i-vol] + val;
    }
}

void MultiplePack(int volume, int val, int vol, int counts)
{
    if(vol * counts > volume)
        CompletelyPack(volume, val, vol);
    int mid = 1;
    while(mid <= counts){
        ZeroOnePack(volume, val*mid, vol*mid);
        counts = counts - mid;
        mid = mid << 1;
    }
    if(counts){
        ZeroOnePack(volume, val*counts, vol*counts);
    }
}

int main()
{
    int n;
    int val[55],counts[55];
    while(cin>>n && n >= 0)
    {
        int sum = 0;
        memset(dp, 0, sizeof(dp));
        for(int i = 0; i < n; i++){
            cin>>val[i]>>counts[i];
            sum += val[i]*counts[i];
        }
        for(int i = 0; i < n; i++){
            MultiplePack(sum/2, val[i], val[i],counts[i]);
        }
        cout<<sum-dp[sum/2]<<" "<<dp[sum/2]<<endl;
    }
    return 0;
}