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
→ Обратите внимание
До соревнования
Refact.ai Match 1 (Codeforces Round 985)
4 дня
Зарегистрироваться »
Refact.ai Match 1 (Codeforces Round 985)
4 дня
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 05.11.2024 15:32:52 (h1).
Десктопная версия, переключиться на мобильную.
При поддержке
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.