Leetcode 3689. Maximum Total Subarray Value I

Since subarrays can overlap and be repeated, the optimal pick is any subarray containing the global maximum and minimum, so the maximum total is simply k * (max(nums) - min(nums)).