I am not able to comment on blog: https://codeforces.net/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 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
6 | adamant | 157 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
I am not able to comment on blog: https://codeforces.net/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 |
---|