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 ?
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 23.12.2024 02:07:50 (h2).
Десктопная версия, переключиться на мобильную.
При поддержке
Cause when we buy i-th item we will have this item plus t[i] items, in sum we have t[i]+1 item instead t[i]
ok ..
so our number of items increase by t[i]+1 if we but i_th item , but how will we reduce it to knapsack equation , what will be the dp state & base case ?
U can use my solution to better understand 40091182 There dp[i][j] means minimum cost of j items when we already looked through i items
what does dp[i][j] means in ur code ?
i can be the item that you are currently processing ?
what does j refers here ? can you please tell me a bit !
There dp[i][j] means minimum cost of j items when we already looked through i items