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).
標簽：
SubSequence
Sequence
Problem
Longest
上傳時間：
2016-12-08
上傳用戶：busterman
