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) ?
Need help with lazy propagation implementation
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) ?
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3843 |
| 2 | jiangly | 3705 |
| 3 | Benq | 3628 |
| 4 | orzdevinwang | 3571 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3530 |
| 8 | ecnerwala | 3499 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 163 |
| 2 | adamant | 163 |
| 4 | TheScrasse | 157 |
| 5 | nor | 153 |
| 6 | maroonrk | 152 |
| 6 | -is-this-fft- | 152 |
| 8 | Petr | 145 |
| 9 | orz | 144 |
| 9 | pajenegod | 144 |
