Leetcode 2789. Largest Element in an Array after Merge Operations

Given a positive integer array where you may repeatedly merge an adjacent pair (i,i+1) only if nums[i] <= nums[i+1] by replacing nums[i+1] with their sum and deleting nums[i], compute the maximum element attainable in any final array. The core challenge is choosing the order of inequality-constrained merges to maximize a value (n up to 1e5), typically handled by greedily aggregating mergeable runs.