| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 153 |
| 2 | nik_exists | 151 |
| 3 | maroonrk | 150 |
| 4 | maspy | 149 |
| 5 | AmShZ | 146 |
| 6 | Um_nik | 143 |
| 7 | Errichto | 139 |
| 8 | adamant | 135 |
| 9 | BledDest | 134 |
| 10 | cry | 130 |
| Название |
|---|



It's pretty much Knapsack DP.
I will mention the dynamics:
$$$dp_{i,j,0}\ =maximum \ amount \ paid\ for\ first\ i\ elements\ with\ sweetness\ \lt =j\ and\ operation\ is not\ used.$$$
$$$dp_{i,j,1}\ =maximum \ amount \ paid\ for\ first\ i\ elements\ with\ sweetness\ \lt =j\ and\ operation\ is\ used.$$$
$$$Transitions\ are\ similar\ to\ Knapsack\ DP.$$$
Your answer will be $$$max(dp[n][m][0]\ ,\ dp[n][m][1])$$$
My solution: https://ideone.com/NgqsT4
Brother please can you clear my doubt I use 3 dp states dp[n][m][flag] The code passed the test cases but when I was using 2 dp states dp[n][m] and was updating the value for flag . Then it was failing on few cases why is so???
This is my previous code:- https://pastebin.com/E1hqm56H
This is new code:- https://pastebin.com/xEqn2Uq8
The problem is with the statement
, since we don't know if flag was true or false, in the returned state,so it may lead to overcount.
Thanks I understood my mistake