Consider the following problem : Your are given an array $$$a_1, a_2, ..., a_n$$$ and q queries of form $$$l r$$$. For each query you have to find the MEX of the array $$$a_l, a_l+1, ..., a_r$$$.
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 136 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
→ Find user
→ Recent actions
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en19 |
|
one_autum_leaf | 2023-06-27 20:24:52 | 15 | Tiny change: 'discussed [here](ht' -> 'discussed in the comment [here](ht' | |
| en18 |
|
one_autum_leaf | 2023-06-27 20:24:09 | 30 | (published) | |
| en17 |
|
one_autum_leaf | 2023-06-27 20:22:14 | 26 | Tiny change: ', 0]$.\n\n. Updating' -> 'O(q log n)$. Updating' | |
| en13 |
|
one_autum_leaf | 2023-06-27 20:15:42 | 253 | ||
| en12 |
|
one_autum_leaf | 2023-06-27 20:12:53 | 15 | Tiny change: 'array is $1, 0$.\n\n![ ]' -> 'array is $[a_2, a_3] = [1, 0]$.\n\n![ ]' | |
| en11 |
|
one_autum_leaf | 2023-06-27 20:12:17 | 519 | Tiny change: 'imgur.com/a/UkzuMa5)\n\n~~~~~' -> 'imgur.com/5TOuXF6)\n\n~~~~~' | |
| en10 |
|
one_autum_leaf | 2023-06-27 20:02:50 | 35 | Tiny change: '., a_r$.\n\n~~~~~\' -> '., a_r$.\n\n\n~~~~~\' | |
| en9 |
|
one_autum_leaf | 2023-06-27 19:48:07 | 163 | ||
| en8 |
|
one_autum_leaf | 2023-06-27 19:45:55 | 1610 | Tiny change: 'egin{math}a_x = 1\end{math}\begin{math}a_x = 1\end{math}\begin{math}' -> 'egin{math}' | |
| en7 |
|
one_autum_leaf | 2023-06-27 19:10:31 | 36 | ||
| en6 |
|
one_autum_leaf | 2023-06-27 19:09:34 | 3 | Tiny change: 'et $b_x = $ \bigl\{\n\n~~~~~\' -> 'et $b_x = \bigl\{ $\n\n~~~~~\' | |
| en5 |
|
one_autum_leaf | 2023-06-27 19:09:15 | 199 | ||
| en4 |
|
one_autum_leaf | 2023-06-27 19:00:34 | 1566 | ||
| en3 |
|
one_autum_leaf | 2023-06-27 18:52:21 | 180 | ||
| en2 |
|
one_autum_leaf | 2023-06-27 18:50:49 | 2 | Tiny change: 'y $a_l, a_l+1, ..., a_r' -> 'y $a_l, a_{l+1}, ..., a_r' | |
| en1 |
|
one_autum_leaf | 2023-06-27 18:50:11 | 222 | Initial revision (saved to drafts) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/25/2026 13:29:01 (g2).
Desktop version, switch to mobile version.
Supported by
