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