入门题
A set of n 1-dimensional items have to be packed in identical bins. All bins have exactly the same length l and each item i has length li<=l . We look for a minimal number of bins q such thatA set of n 1-dimensional items hav
阅读背景：
【贪心】Bin Packing_倔强的blackatao的博客_bin pack
来源：互联网
分享到：
