Problem 3350 · Medium

Adjacent Increasing Subarrays Detection II

Split the array into strictly increasing runs; the best k comes from a run split in half or two neighboring runs.

Open the interactive visualisation