I am not able to comment on blog: https://mirror.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
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
I am not able to comment on blog: https://mirror.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
Название |
---|