Given an array of size N.There can be multiple queries of the following types. 1 . Update(l, r, x) : Increment the a[i] (l <= i <= r) with value x. 2 . query(l, r): Find index of the maximum value in the array in a range l to r (both are included).
→ Обратите внимание
До соревнования
Codeforces Round (Div. 1, Based on Zhili Cup 2026)
5 дней
Зарегистрироваться »
Codeforces Round (Div. 1, Based on Zhili Cup 2026)
5 дней
Зарегистрироваться »
*есть доп. регистрация
До соревнования
Codeforces Round (Div. 2, Based on Zhili Cup 2026)
5 дней
Зарегистрироваться »
Codeforces Round (Div. 2, Based on Zhili Cup 2026)
5 дней
Зарегистрироваться »
*есть доп. регистрация
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 01.05.2026 19:26:32 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
I can't understand your description. Can you post link to source?
Hi can you please help me with my blog here question
People are downvoting for no reason.
Please have some courtesy. Do not hijack other people's blog post with irrelevant stuff.
This can be solved with SQRT decomposition , you just need to save the maximum value and the index with the maximum value for each block and it can be easily updated.
maximum value and the index with the maximum value for each block
With the index, we can always get back the value. Why save both?
If you use the index to get the current value of some position, you would need to update each array element, which is what you would like to avoid with lazy propagation and similar techniques.