Increasing Addition

You have an array $A$ of length $N$. In one operation, you can do the following: - Select any subarray $A_{L \ldots R}$ $(1 \le L \le R \le N)$ and then add $i$ to the $i$-th element of this subarray. Formally, we set $A_j := A_j + (j - L + 1)$ for all $L \le j \le R$. For example: if $A = [2, 1, 5, 2]$ and we apply operation on $A_{2 \ldots 4}$ then $A$ becomes $[2, 1 + 1, 5 + 2, 2 + 3] = [2, 2