I've solved this problem using sqrt decomposition. but how can i solve it using segment tree?
Thanks in advance :)
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | Dominater069 | 151 |
9 | maroonrk | 151 |
I've solved this problem using sqrt decomposition. but how can i solve it using segment tree?
Thanks in advance :)
Name |
---|
You can solve this problem without sqrt decomposition and segment tree. See this 11088217 submission
[DELETED]
That solution uses the idea that since we're asking for all numbers x that have at least x occurences, and the maximum number of elements is 105, the maximum amount of such numbers is 446, because .
While it's not Mo's algorithm or dividing the queries into buckets, it's still based on the concept of square root.