Description: By n with non-integer composed of the same series, recorded as: a (1), a (2), ... ..., a (n) and a (i) < > a (j) (i < > j ) For example 3,18,7,14,10,12,23,41,16,24. If there is i1 <i2<i3< … < ie 且有a(i1)<a(i2)< … <a(ie)则称为长度为e的不下降序列。如上例中3，18，23，24就是一个长度为4的不下降序列，同时也有3，7，10，12，16，24长度为6的不下降序列。程序要求，当原数列给出之后，求出最长的不下降序列。
To Search:
- [5] - Design a O (n* n) time algorithm to find
File list (Check if you may need any files):
li1.pas
Download