MAX-SEG

You are given two arrays $A$ and $B$ of length $N$. The array $B$ contains only zeros and ones. You are given $Q$ queries, each of which consists of two integers $L$ and $R$, $L\leq R$. Consider a partition of the interval $[L, R]$ into some $k \geq 1$ subintervals $[l_1, r_1], [l_2, r_2], \dots, [l_k, r_k]$ satisfying the following conditions: * $l_1 = L$ and $r_k = R$ * $l_i \leq r_i$ for ever