Good Sequence

Suppose you have a **binary** array $B$ of length $N$. A sequence $x_1, x_2, \ldots, x_k$ is called *good* with respect to $B$ if it satisfies the following conditions: - $1 \leq x_1 \lt x_2 \lt \ldots \lt x_k \leq N+1$ - For *every* pair $(i, j)$ such that $1 \leq i \lt j \leq k$, the subarray $B[x_i: x_j-1]$ contains $(j-i)$ more ones than zeros. - That is, if $B[x_i : x_j-1]$ contains $c_