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
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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
Name |
---|
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:
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.