Problem 3231 · Hard

Minimum Number of Increasing Subsequence to Be Removed

Deal values onto piles like patience sorting: each value joins the pile with the largest top below it, and the pile count is the answer.

Open the interactive visualisation