设计一个O(n2)时间的算法，找出由n个数组成的序列的最长单调递增子序列。-design an O (n2) time algorithm to identify by the number n of the longest sequence monotonically increasing sequences.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.002895s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.139186s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.002633s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.003150s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.002627s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.005930s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.002549s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.005272s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.023988s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.003406s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 291168 [ RunTime:0.001539s ]
