2018年4月16日
FZU - 2214 Knapsack problem 01背包逆思维
摘要： Knapsack problem Given a set of n items, each with a weight w[i] and a value v[i], determine a way to choose the items into a knapsack so that the tot 阅读全文
posted @ 2018-04-16 23:40 yzm10 阅读(193) 评论(0) 推荐(0) 编辑