I've solved this problem using sqrt decomposition. but how can i solve it using segment tree?
Thanks in advance :)
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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.