HDU-1059 Dividing (多重背包二进制优化+剪枝)

Borrrrrrrrrrrram

于 2017-11-08 21:37:01 发布

阅读量593

点赞数

分类专栏：动态规划-背包文章标签： HDU acm 分组背包动态规划

本文链接：https://blog.csdn.net/hmc0411/article/details/78483628

版权

Dividing

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 27707 Accepted Submission(s): 7961

Problem Description

Marsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the marbles had the same value, because then they could just split the collection in half. But unfortunately, some of the marbles are larger, or more beautiful than others. So, Marsha and Bill start by assigning a value, a natural number between one and six, to each marble. Now they want to d