【UVA-562】Dividing coins（背包）

最新推荐文章于 2020-07-22 20:14:03 发布

is_wyQ

最新推荐文章于 2020-07-22 20:14:03 发布

阅读量443

点赞数

分类专栏： ACM 文章标签： UVA 562 dp 背包 01背包

本文链接：https://blog.csdn.net/iceiceicpc/article/details/50824725

版权

ACM 专栏收录该内容

82 篇文章 1 订阅

订阅专栏

Description

It’s commonly known that the Dutch have invented copper-wire. Two Dutch men were fighting over a nickel, which was made of copper. They were both so eager to get it and the fighting was so fierce, they stretched the coin to great length and thus created copper-wire.

Not commonly known is that the fighting started, after the two Dutch tried to divide a bag with coins between the two of them. The contents of the bag appeared not to be equally divisible. The Dutch of the past couldn’t stand the fact that a division should favour one of them and they always wanted a fair share to the very last cent. Nowadays fighting over a single cent will not be seen anymore, but being capable of making an equal division as fair as possible is something that will remain important forever…

That’s what this whole problem is about. Not everyone is capable of seeing instantly what’s the most fair division of a bag of coins between two persons. Your help is asked to solve this problem.

Given a bag with a maximum of 100 coins, determine the most fair division between two persons. This means that the difference between the amount each person obtains should be minimised. The value of a coin varies from 1 cent to 500 cents. It’s not allowed to split a single coin.

Input

A line with the number of problems n, followed by n times:
a line with a non negative integer m ( $m \le 100$ ) indicating the number of coins in the bag
a line with m numbers separated by one space, each number indicates the value of a coin.

Output

The output consists of n lines. Each line contains the minimal positive difference between the amount the two persons obtain when they divide the coins from the corresponding bag.

Sample Input

2
3
2 3 5
4
1 2 4 6

Sample Output

0
1

题目大意

给你n个硬币，每个硬币都有一个价值，尽可能的将这这些硬币平分成两部分，也就是说这两部分的价值应该尽可能的接近，求这两部分价值差的绝对值。

思路

将总价值平分后，对一半进行01背包，另外一半直接总价值sum-dp[sum/2]就可以了。最后的答案就是abs(sum-2*dp[sum/2])。

代码

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

using namespace std;

const int maxn=50000+5;

int dp[maxn],v[105],n;

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        memset(dp,0,sizeof(dp));
        memset(v,0,sizeof(0));
        scanf("%d",&n);
        int sum=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&v[i]);
            sum+=v[i];
        }
        for(int i=1;i<=n;i++)
        {
            for(int j=sum/2;j>=v[i];j--)
            {
                dp[j]=max(dp[j],dp[j-v[i]]+v[i]);
            }
        }
        printf("%d\n",abs(sum-2*dp[sum/2]));

    }
    return 0;
}