2016年4月18日
UVA 1149 Bin Packing 二分+贪心
摘要： A set of n 1-dimensional items have to be packed in identical bins. All bins have exactly the samelength l and each item i has length li ≤ l. We look 阅读全文
posted @ 2016-04-18 18:49 meekyan 阅读(669) 评论(0) 推荐(0) 编辑