For this problem, the tutorial states that maintaining the sum of a Geometric Progression is a simple problem that can be solved using Segment Tree. However, I don't know how to do this (I think Lazy Propogation should be involved). Any help please?
# | 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 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Problem on Lazy Propogation
For this problem, the tutorial states that maintaining the sum of a Geometric Progression is a simple problem that can be solved using Segment Tree. However, I don't know how to do this (I think Lazy Propogation should be involved). Any help please?
Name |
---|