how to do this problem with segment tree data structure. https://www.codechef.com/SEPT17/problems/SEACO
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 26.04.2024 22:44:26 (l1).
Десктопная версия, переключиться на мобильную.
При поддержке
First of all, you need to count how many times a command will be executed. It can done by starting with higher index and work only for type 2.
Secondly, for each command of type 1 perform this command previously calculated times.
Sorry for my bad English.
Almost Same Problem: 295A - Greg and Array
Here time limit is 1.5 sec itna can easly doen in O(qn)
You need to solve this task in O(nlogn) in both problem. You can use seg. tree/bit/difference table
can you share the code
Codechef Problem Code: https://www.codechef.com/viewsolution/17062635
I think it could be solved using prefix sums :D