I am not able to comment on blog: https://codeforces.com/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 | 3783 |
2 | jiangly | 3772 |
3 | tourist | 3706 |
4 | maroonrk | 3609 |
5 | Um_nik | 3591 |
6 | fantasy | 3526 |
7 | ko_osaga | 3500 |
8 | inaFSTream | 3477 |
9 | cnnfls_csy | 3427 |
10 | zh0ukangyang | 3423 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 185 |
2 | awoo | 182 |
3 | nor | 172 |
4 | -is-this-fft- | 170 |
5 | adamant | 169 |
6 | maroonrk | 165 |
7 | antontrygubO_o | 160 |
8 | SecondThread | 158 |
9 | dario2994 | 152 |
10 | kostka | 151 |
I am not able to comment on blog: https://codeforces.com/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 |
---|