Problems
Give an array consists N integers and Q queries, with two types :
- ? k -> print the kth element in this array.
- ! k -> remove the kth element in this array.
# | User | Rating |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
3 | awoo | 162 |
4 | nor | 153 |
5 | maroonrk | 152 |
6 | -is-this-fft- | 151 |
7 | TheScrasse | 150 |
8 | atcoder_official | 145 |
8 | Petr | 145 |
10 | pajenegod | 144 |
[Tutorial] Find the kth element in an array with update queries using Trie
Give an array consists N integers and Q queries, with two types :
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en15 |
![]() |
quanlt206 | 2022-07-10 11:41:57 | 9 | Tiny change: 'ie, O(nlog(max(k))) complexi' -> 'ie, O(nlogn) complexi' | |
en14 |
![]() |
quanlt206 | 2022-07-10 11:31:23 | 9 | ||
en13 |
![]() |
quanlt206 | 2022-07-10 04:17:13 | 7 | ||
en12 |
![]() |
quanlt206 | 2022-07-09 17:51:04 | 12 | Tiny change: ' Trie, O(n) complexi' -> ' Trie, O(nlog(max(k))) complexi' | |
en11 |
![]() |
quanlt206 | 2022-07-09 17:44:29 | 34 | ||
en10 |
![]() |
quanlt206 | 2022-07-09 16:14:47 | 59 | (published) | |
en9 |
![]() |
quanlt206 | 2022-07-09 16:13:46 | 89 | ||
en8 |
![]() |
quanlt206 | 2022-07-09 16:12:39 | 20 | ||
en7 |
![]() |
quanlt206 | 2022-07-09 16:11:10 | 88 | ||
en6 |
![]() |
quanlt206 | 2022-07-09 16:09:10 | 4 | ||
en5 |
![]() |
quanlt206 | 2022-07-09 16:08:15 | 7802 | ||
en4 |
![]() |
quanlt206 | 2022-07-09 15:52:59 | 536 | ||
en3 |
![]() |
quanlt206 | 2022-07-09 11:09:43 | 251 | ||
en2 |
![]() |
quanlt206 | 2022-07-09 08:27:43 | 2271 | ||
en1 |
![]() |
quanlt206 | 2022-07-09 07:27:15 | 277 | Initial revision (saved to drafts) |
Name |
---|