Subarray Removal

Chef has a *permutation* $A$ of length $N$. Chef can perform the following operation on $A$: $\\$ **1)** Select $L$ and $R$ such that $(1 \le L \le R \le N)$ and $(R - L + 1 \lt N)$ $\\$ **2)** Remove the subarray $A_{L \ldots R}$ from $A$. (The remaining parts of $A$ are concatenated) The score of this operation $ = $ length of the subarray removed $ = R - L + 1$ For e.g., if $A = [3, 1, 4, 6,