Leetcode 1043. Partition Array for Maximum Sum

Partition the array into contiguous subarrays of length at most k, replace every value in a subarray with that subarray's maximum, and maximize the resulting total sum. This is a DP-style optimization where for each index you choose the last segment length (≤k) and use its maximum to update the best achievable sum.