Can someone provide me segment tree implementation of:
Range update : Add x to range
Finding frequency of a constant in range
I know of sqrt decomposition exist, but I wanted in terms of segment tree (maybe lazy propagation)?
# | User | Rating |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
# | User | Contrib. |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
4 | cry | 155 |
4 | adamant | 155 |
4 | atcoder_official | 155 |
4 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
Segment Tree
Can someone provide me segment tree implementation of:
Range update : Add x to range
Finding frequency of a constant in range
I know of sqrt decomposition exist, but I wanted in terms of segment tree (maybe lazy propagation)?
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en3 |
![]() |
rahul_1234 | 2017-12-15 16:57:43 | 32 | Tiny change: 'ropagation)?' -> 'ropagation or policy based data structures)?' | |
en2 |
![]() |
rahul_1234 | 2017-12-15 16:57:11 | 12 | Tiny change: ' know of sqrt deco' -> ' know of solution in sqrt deco' | |
en1 |
![]() |
rahul_1234 | 2017-12-15 16:56:39 | 246 | Initial revision (published) |
Name |
---|