Delete Maximum

You are given an array $A$ of $N$ distinct elements satisfying $1 \le A_i \le N$. Consider performing the following operation as many times as you want on $A$, while $|A| > 1$: - Choose a (continuous) subarray$^{\dagger}$ of size $|A| - 1$, and then delete the maximum element of the subarray from the original array. Note that the maximum element is unique due to elements being distinct, and th