Leetcode 2866. Beautiful Towers II

Choose heights within [1, maxHeights[i]] that form a mountain (nondecreasing to a single peak then nonincreasing) to maximize the total sum. Core challenge: for each possible peak, compute the best feasible left/right height profiles under the monotonic constraints (commonly done with prefix/suffix scans or monotonic stacks) and take the maximum total.