Help in this dp problem , 19B ,codeforces

Правка en1, от 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 ?

Теги #dp

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский atlasworld 2018-07-08 19:27:12 241 Initial revision (published)