The problem is the following:
Given an array of positive integers, find the minimum length ascending subsequence such that after removing this subsequenc
