UVA562(01背包均分问题)
2016-02-12 12:07
369 查看
Dividing coins
Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu
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.
a line with a non negative integer m (
![](http://7xjob4.com1.z0.glb.clouddn.com/6af1da465de5986348d8f25935012435)
) 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.
题意:给出n个硬币,将这些硬币分给两个人,使这两个人的硬币面值之差最小。
思路:尽可能的将硬币的面值平均分。
Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu
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 (
) 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个硬币,将这些硬币分给两个人,使这两个人的硬币面值之差最小。
思路:尽可能的将硬币的面值平均分。
#include"cstdio" #include"cstring" #include"algorithm" using namespace std; const int MAXN=50005; int n; int w[MAXN]; int dp[MAXN]; int main() { int T; scanf("%d",&T); while(T--) { memset(dp,0,sizeof(dp)); scanf("%d",&n); int sum=0; for(int i=0;i<n;i++) { scanf("%d",&w[i]); sum+=w[i]; } for(int i=0;i<n;i++) { for(int j=sum/2;j>=w[i];j--) dp[j]=max(dp[j],dp[j-w[i]]+w[i]); } printf("%d\n",abs(sum-2*dp[sum/2])); } return 0; }
相关文章推荐
- Trimble.Terramodel.HYDROpro.v2.40.954 含中文版 水上测绘工程软件
- Building Maintainable Software-java篇之Write Short Units of Code
- Scala 基础入门【翻译】
- SQL Server 中的事务与事务隔离级别以及如何理解脏读, 未提交读,不可重复读和幻读产生的过程和原因
- mysql数据库C API函数mysql_store_result和mysql_use_result的区别
- 排序算法-快速排序算法
- ANDROID_MARS学习笔记_S01_010日期时间控件
- sql 替换字符串 replace用法
- Csimsoft.Bolt.v1.0.0.X64 螺栓设计 + CEETRON.GLView.Inova.v10.0.0.Win32 64 linux 数据三维可视化工具
- 51nod 活动安排问题之二
- Windows7/8.1推送一个新的补丁KB3123862 这个补丁绝对别碰
- 买电脑需要考虑的电脑配置
- iOS模拟器模拟器快捷键
- hdu 5294 Tricks Device
- SmartPtrTA
- makefile 文件编写规则
- Android样式的开发:Shape篇
- html5全屏
- 深入理解Java虚拟机----(九)程序编译和代码优化
- 【Win 10 应用开发】共享目标(UWP)