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 | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | atcoder_official | 156 |
4 | cry | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 154 |
7 | adamant | 154 |
9 | Um_nik | 152 |
10 | djm03178 | 146 |
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) |
Название |
---|