UVA 562 Dividing coins(DP:01背包)

UVA 562  Dividing coins(DP:01背包)

题意:有N个不同价值的硬币,问你如何分成两堆,可以使得这两对的总价值之差的绝对值最小?

分析:本题只需要用所有硬币的价值和sum除以2,即sum/2作为背包容量,看看最多能装多少,就得解.

AC代码:

#include <iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;

const int MAXN=120;
const int MAXW=50005;
int weight[MAXN],dp[MAXW];
int nKind,nWeight;
void ZeroOnePack()
{
    for(int i=1;i<=nKind;i++)
        for(int j=nWeight;j>=weight[i];j--)
            dp[j]=max(dp[j],dp[j-weight[i]]+weight[i]);
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&nKind);
        nWeight=0;
        int sum=0;
        for(int i=1;i<=nKind;i++)
        {
            scanf("%d",&weight[i]);
            sum += weight[i];
        }
        nWeight =sum/2;
        memset(dp,0,sizeof(dp));
        ZeroOnePack();
        printf("%d\n",sum-2*dp[nWeight]);
    }
    return 0;
}