# | 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 |
Name |
---|
for O((n+m) log n) solution see here
could you explain your solution?
Sort the array keeping track of indexes so I have A[0] is the index of smallest number and A[n-1] is the index of biggest number
Now if I want K-th smallest number in range [l,r] the naive way is like the code
This has complexity O(n) for each operation
I use sqrt decompstion to make it faster
Can you please comment your code a bit so that it makes it easier to understand? I have no idea what your pre[][] array does and not able to understand it from the link that you've posted.
pre[i][j] means how many indexes between 1 and j exists in ith block
it is hard to understand idea from your code, but when you explain I got it,thanks,great idea ;)