UVA 562 Dividing coins(dp + 01背包)

发布时间:2014-10-22 12:06:29编辑:www.fx114.net 分享查询网我要评论
本篇文章主要介绍了"UVA 562 Dividing coins(dp + 01背包)",主要涉及到UVA 562 Dividing coins(dp + 01背包)方面的内容,对于UVA 562 Dividing coins(dp + 01背包)感兴趣的同学可以参考一下。

Dividing coins 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 () indicating the number of coins in the baga 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 题意:一堆硬币分给两个人,要求两个人得到钱差值最少,输出这个差值。 思路:01背包。硬币总价值为sum,一个人分到i,另一个人肯定分到sum - i,如果硬币尽量平分是最好的,先用01背包求出所有可能组成的值,然后从sum / 2开始找,找到一个可以组成的值作为i,他们的差值为sum - 2 * i。 代码: #include <stdio.h> #include <string.h> int t, n, coin[105], sum, i, j, dp[50005]; int main() { scanf("%d", &t); while (t --) { scanf("%d", &n); sum = 0; memset(dp, 0, sizeof(dp)); dp[0] = 1; for (i = 0; i < n; i ++) { scanf("%d", &coin[i]); sum += coin[i]; } for (i = 0; i < n; i ++) for (j = sum; j >= coin[i]; j --) { if (dp[j - coin[i]]) dp[j] = 1; } for (i = sum / 2; i >= 0; i --) if (dp[i]) { printf("%d\n", sum - i * 2); break; } } return 0; }