Hello Codeforces!! .I have a general doubt given an array of max size 10^5 ,how can we find the maximum and minimum element in each subarray in best complexity? Thanks in advance!!!
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
A general doubt regarding subarrays...
Hello Codeforces!! .I have a general doubt given an array of max size 10^5 ,how can we find the maximum and minimum element in each subarray in best complexity? Thanks in advance!!!
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en1 | RonoroaZoro | 2018-06-20 19:20:54 | 223 | Initial revision (published) |
Название |
---|