№ | Пользователь | Рейтинг |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
Название |
---|
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 ;)