Help in this dp problem , 19B ,codeforces

Revision en1, by atlasworld, 2018-07-08 19:27:12

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 ?

Tags #dp

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English atlasworld 2018-07-08 19:27:12 241 Initial revision (published)