Segment tree can be efficiently and shortly implemented using bitwise operators . Is there any way to implement lazy propagation update operation using bitwise operators (i.e. using no recursive operations) ?
# | User | Rating |
---|---|---|
1 | ecnerwala | 3650 |
2 | Benq | 3582 |
3 | Geothermal | 3570 |
3 | orzdevinwang | 3570 |
5 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3532 |
8 | Radewoosh | 3522 |
9 | Um_nik | 3483 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 150 |
9 | orz | 146 |
10 | pajenegod | 145 |
Segment tree can be efficiently and shortly implemented using bitwise operators . Is there any way to implement lazy propagation update operation using bitwise operators (i.e. using no recursive operations) ?
Name |
---|
Auto comment: topic has been updated by ahshafi (previous revision, new revision, compare).
Below the heading, lazy propagation on this blog.
Thanks for such amazing suggestion