Subtraction Sequence I

Consider an array $B$ of size $M$. We must perform the following operations with parameter $i = M-1, M-2, \ldots, 1$ (in this order): *Note that the order of operations is different than SUBSEQII*. - Choose an index $j$ such that $i \lt j \le M$; - Replace $B_j$ in the array with $\max(0, B_j - B_i)$. Note that the subsequent operations will be performed with the updated array $B$. At th