LIS問題及擴展

轉自：http://blog.csdn.net/designer_/article/details/5457836 算法  這是O（n^2）的算法：數組   view plain ·········10········20········30········40········50········60········70········80········90········100·······1

>>阅读原文<<