Problem 60426. Reversing Maximal Ascending Subsequences

minnolina

11 solvers

0 likes

Solve

Solve Later

Create and return a new array that contains the same elements as the input array, but with the elements within each strictly increasing maximal subsequence reversed. 
Example:
Given the input array [5, 7, 10, 4, 2, 7, 8, 1, 3], the strictly increasing maximal subsequences are [5, 7, 10], [2, 7, 8], and [1, 3]. Reversing these subsequences gives [10, 7, 5], [8, 7, 2], and [3, 1], respectively. The output array is thus [10, 7, 5, 4, 8, 7, 2, 3, 1].