A part of this Problem :
For every query range [L,R] (1 <= L<= R <= n) How to calculate maximum length subarray of 1 within segment [L,R].
1 <= n,query <= 100000
- n = 10
- [1, 9, 2, 3, 1, 1, 1, 4, 1, 1]
- L = 3 , R = 10
- answer = 3
№ | Пользователь | Рейтинг |
---|---|---|
Нет данных |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 173 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 160 |
5 | nor | 157 |
6 | maroonrk | 155 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | pajenegod | 145 |
A part of this Problem :
For every query range [L,R] (1 <= L<= R <= n) How to calculate maximum length subarray of 1 within segment [L,R].
1 <= n,query <= 100000
Название |
---|