Problem 60426. Reversing Maximal Ascending Subsequences
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].
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers8
Suggested Problems
-
2239 Solvers
-
222 Solvers
-
Split a string into chunks of specified length
1678 Solvers
-
How many days does the cat take to climb out of the hole?
77 Solvers
-
532 Solvers
More from this Author53
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!