Move Negative Stones

You’re given an array $A$ containing $N$ integers. Your task is to make $A_i \geq 0$ for all $1 \leq i \leq N$. To achieve that, you can perform the following operation: - Choose an index $i$ ($1 \le i \lt N$) and any integer $X$ ($X$ can be negative); - Subtract $X$ from $A_i$ and add $X$ to $A_{i+1}$. That is, set $A_i:= A_i - X$ and $A_{i+1} := A_{i+1} + X$. Find the **minimum** number of