how to do this problem with segment tree data structure. https://www.codechef.com/SEPT17/problems/SEACO
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 151 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/23/2024 06:59:23 (j3).
Desktop version, switch to mobile version.
Supported by
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 - Егор и массив
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