How can i solve that problem? please help...i know about lazy segment tree...but i am failed to apply lazy segment tree... problem link-> : https://www.spoj.com/problems/MULTQ3/
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 161 |
3 | maomao90 | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
How can i solve that problem? please help...i know about lazy segment tree...but i am failed to apply lazy segment tree... problem link-> : https://www.spoj.com/problems/MULTQ3/
Name |
---|
First of all instead of storing the numbers just store the modulos. That is each A[i] change it to A[i] % 3. This way you just have to deal with 3 numbers 0, 1 and 2.
In the tree node store an array cnt[0..2] this stores the count of all the numbers with such mods for that Range.
In the lazy node store the pending updates % 3. ( See yourself why )
When updating lazily Apply the pending updates.
If there is no pending update do nothing,
If there is 1 pending update change. (like cnt[1] will become cnt[0], cnt[2] = cnt[1] and cnt[0] = cnt[2] )
If there are 2 pending updates swap(cnt[2], cnt[0] ) and cnt[1] won't be affected.
Finally answer for a range is just summing cnt[0]'s for appropriate ranges ( like standard sum query)