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 ?
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
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 ?
Name |
---|
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