背包問題
文章平均质量分 67
ZustinLau
I am currently studying Economics at the Chinese University of Hong Kong and I am interested in data structure and algorithms.
展开
-
2218. Maximum Value of K Coins From Piles
It is a hidden 01 knapsack problem. The elements are in the stack, which we can only take it one by one from the top, makes it little hard to do the knapsack. However, we can preprocess the data, making the pile to be a prefix sum pile, which we can get t原创 2022-03-28 02:44:10 · 148 阅读 · 0 评论 -
P2014 [CTSC1997] 选课
bagpack原创 2022-03-26 00:35:30 · 87 阅读 · 0 评论