Given multiple queries of the form : "L R k" , how to find the count of numbers less than 'k' in the range {L,R} of the array.
There are no update queries.
N=1000000.
I am not interested in the solution with a merge-sort-tree .
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
How to find the count of numbers less than 'k' in a given range of array?
Given multiple queries of the form : "L R k" , how to find the count of numbers less than 'k' in the range {L,R} of the array.
There are no update queries.
N=1000000.
I am not interested in the solution with a merge-sort-tree .
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | I_love_Saundarya | 2019-08-06 21:59:56 | 79 | |||
en1 | I_love_Saundarya | 2019-08-06 21:48:22 | 233 | Initial revision (published) |
Name |
---|