So far I have tried this code but couldn't approach to the optimised way of solving the problem. A small hint would be a great help instead of complete solution.
Link to the problem : https://cses.fi/problemset/task/2416
So far I have tried this code but couldn't approach to the optimised way of solving the problem. A small hint would be a great help instead of complete solution.
Link to the problem : https://cses.fi/problemset/task/2416
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 142 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 136 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
Did you solved it ?
see dolphingarlic's explanation + solution
You can use segment tree to solve this problem.
Use it for the sum and max of range l..r
When query asks a range l r you can do the following steps. 1) start with range 1, n
2) go both children (you have to go first to left one)
3) if your current range is out of required range return 0
4) if your current range is complete in required range:
{ MX = max(MX, curMX); return MX*(curR-curL+1)-curSum }5) return sum of children
I don't think this is a correct solution. (or maybe I misinterpreted it)
If I have an array [0,2,4,0] and I want to query (1,4), this solution will yield 10 as answer. (while the answer should be 4)
You can try using binary lifting + monotonic stack. :) (Just a hint)
would you like to share your solution?
tysm for the hint man, solved it because of that.