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
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/19/2026 02:16:35 (g2).
Desktop version, switch to mobile version.
Supported by
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.