Problem 3691 · Hard

Maximum Total Subarray Value II

Pick exactly k different subarrays, which may overlap, where each is worth its maximum minus its minimum. Return the largest total value.

Open the interactive visualisation