Leetcode 3638. Maximum Balanced Shipments

Select the maximum number of non-overlapping contiguous subarrays such that in each chosen segment the last element is strictly less than the maximum element of that segment. With n up to 1e5, the core challenge is deciding optimal cut points (typically via a greedy/DP strategy using running maxima) to maximize the count.