Sequence Cost

MoEngage has given you an array $A$ of $N$ integers and a positive integer $C$. You can apply the following operation on the array **any** number of times. In one operation: - Choose a **strictly increasing** array $B$ of length $M$ such that: - $B_1 = 1, B_M = N,$ and $1 < B_i < N$ for all $(1 < i < M)$; - $A_{B_i} \gt 0$ for all $(1 \leq i \leq M)$. - Subtract $1$ from $A_{B_i}$ for al