Updating A

Alice and Bob have an array of $A$ of $N$ elements, and will play a game on it. They alternate turns, with Alice going first. On each turn: - Let $M$ denote the current length of $A$. If $M = 1$, the game stops. Otherwise, the current player *must* make a move. - On Alice's turn, she must choose integers $L$ and $R$ ($1 \leq L \lt R \leq M$), delete the elements $A_L, A_{L+1}, \ldots, A_R$ f