# | 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 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
7 | SecondThread | 150 |
9 | orz | 146 |
10 | pajenegod | 145 |
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 ;)