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 | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
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 |
---|