Maximise Sum

You are given an array $A$ consisting of $N$ positive integers. You are allowed to do the following operation any number of times: - Select two integers $l$ and $r$ such that $1 \leq l < r \leq N$; - Change $A_i$ to $\min(A_l, A_r)$ for all $l < i < r$. Find the **maximum** value of $\sum_{i=1}^{N} A_i$ that you can achieve after any (possibly zero) number of operations. ### Input - The first