Min-Max Deletion

For an array $B$ of length $M$, we define $f(B)$ as follows: - Initialize $\text{score} = 0$. - Then, perform the following operation $M-1$ times: - Choose an index $i$ ($1 \leq i \lt |B|$). - Add $\min(B_i, B_{i+1})$ to $\text{score}$, and then delete $\max(B_i, B_{i+1})$ from $B$. This reduces the length of $B$ by exactly $1$. $f(B)$ is defined to be the maximum possible value of $\te