摘要：The problem of finding a longest increasing subsequence (LIS) is a well known task insequence processing. There are many variants of the basic task. We discuss a recently introduced variant ofLIS, a minimal height longest increasing subsequence problem and propose a new algorithm for it, whichimproves its time complexity. Moreover, we define a family of similar problems and introduce algorithmssolving them.
