The longest monotone subsequences, algorithm desig
no vote
Monotone increasing subsequence and decreasing subsequence are included in monotone increasing subsequence, which is general. Only monotone increasing subsequence is discussed here. First of all, we should define our problems. Given sequence A1, A2 , an, if there are subsequences Ai1 & lt; = AI2 & lt; = ≪ = aim, (where I1 & lt; I2 & lt ≪ IM) is called a monotone increasing subsequence with the length m of the original sequence. Then, the problem now is to find the longest monotone increasing subsequence of a sequence.