can anyone please explain how this problem will reduce to 0/1 Knapsack problem after increasing each t[i] by 1?
why we are increasing t[i] by 1 ?
Help in this dp problem , 19B ,codeforces
can anyone please explain how this problem will reduce to 0/1 Knapsack problem after increasing each t[i] by 1?
why we are increasing t[i] by 1 ?
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en1 | atlasworld | 2018-07-08 19:27:12 | 241 | Initial revision (published) |