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 | jiangly | 3898 |
| 2 | tourist | 3840 |
| 3 | orzdevinwang | 3706 |
| 4 | ksun48 | 3691 |
| 5 | jqdai0815 | 3682 |
| 6 | ecnerwala | 3525 |
| 7 | gamegame | 3477 |
| 8 | Benq | 3468 |
| 9 | Ormlis | 3381 |
| 10 | maroonrk | 3379 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | -is-this-fft- | 165 |
| 3 | Dominater069 | 160 |
| 4 | atcoder_official | 159 |
| 4 | Um_nik | 159 |
| 6 | djm03178 | 156 |
| 7 | adamant | 153 |
| 8 | luogu_official | 149 |
| 8 | awoo | 149 |
| 10 | TheScrasse | 146 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2025 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 07.02.2025 20:01:00 (j1).
Десктопная версия, переключиться на мобильную.
При поддержке
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