I am not able to comment on blog: https://codeforces.me/blog/entry/68138
I am not even able to message to the user.
Let me know if someone else is also having some issues. Thanks
| # | 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 |
I am not able to comment on blog: https://codeforces.me/blog/entry/68138
I am not even able to message to the user.
Let me know if someone else is also having some issues. Thanks
I recently gave a hiring test and was stuck on a particular problem. The problem is as follows:
You are given an array A of N elements and Q queries of the form L,R.
For every query find the first missing positive integer in the range A[L],A[L+1],A[L+2] ...... A[R].
N <= 10^6
Q <= 10^6
1<= A[i] <= 10^9
I know how to find the first missing positive in O(N) but don't know how to handle multiple queries in less time. Any help would be appreciated. Thanks
| Name |
|---|


