In complete backpack problem, the 1Darray dp solution is a optimization of 2Darray dp solution.In the discuss , most solution is 1Darray dp solution, how to write the 2Darray dp solution just like the complete backpack problem?
Is there 2Darray dp solution just like the complete backpack problem?


I think there is. But is not simple as 1Darray. Because we need to scan the 2Darray, column by column and each time scan the first row element of j column, we need to use the last row element of column j  1. It makes it not easy.
Even if this problem seems like 0/1 backpack problem, but we'd better think is as what the top solution shows