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 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 148 |
9 | pajenegod | 145 |
9 | orz | 145 |
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)