Minimum Number of Increasing Subsequence to Be Removed

Given an integer array, find the minimum number of (not-necessarily-contiguous) strictly increasing subsequences you must remove to delete all elements. The core challenge is a chain decomposition problem that reduces to computing the length of the longest non‑increasing (or decreasing) subsequence (think Dilworth’s theorem / patience-sorting style greedy).