Positive-Negative

Alice and Bob have with them an array $A$ of length $N$. It is known that $A_i = 1$ or $A_i = -1$ for each $1 \le i \le N$. It is also guaranteed that there exists at least one index satisfying $A_i = 1$. They will play the following game on it: - On Alice's turn, she must choose two integers $L$ and $R$ such that $1 \le L \le R \le |A|$ and $A_L + A_{L+1} + \ldots + A_R \ge 0$, and delete