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 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
[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 |
|---|


