here is the link to the problem PROBLEM According to the editorial, this problem is solved using binary search +dp, but can we solve it with 2-D dp or any other way without using binary search ?
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 4 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 134 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
here is the link to the problem PROBLEM According to the editorial, this problem is solved using binary search +dp, but can we solve it with 2-D dp or any other way without using binary search ?
| Name |
|---|



If you drop the CP mentality of using algorithms that have good asymptotic runtime and deterministic results, we can use local search to find the answer as well, I didn't try. But it looks promising.
I was looking for some other algorithm other than that mention above for deterministic results.