C - Check Good

An array $B$ of length $M$ is considered **good** if there exists a permutation $P$ of $[1, 2, \ldots, M]$ such that for every $i$ $(1 \leq i \leq M)$, the following condition holds: $$ B_i = \max(P_1, P_2, \ldots, P_i) - \min(P_1, P_2, \ldots, P_i) $$ You are given an array $A$ of length $N$. For each integer $i$ $(1 \leq i \leq N)$, determine whether there exists a **subarray**$^{\dagger}$ $