To Be A Brave One

最近开始研究算法，就开始做Top Coder，看到了一道动态规划的题目不错，贴过来和大家讨论。 ———————————- Problem Statement Maybe you don’t know, but you are a fanatic of colored marbles. You want to collect them all, but you may not be able to carry them. You have numberOfBags bags, each of capacity bagCapacity grams. The i-th marble has a weight of marblesWeight[i] grams. You can go to the …