Problem B:Longest Ordered Subsequence

A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8). -Problem B: Longest Ordered SubsequenceA numeric sequence of ai is ordered if a1 <a2 <... <aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 <i2 <... <iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, eg, ( 1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, eg, (1, 3, 5, 8).