Description: Given an array by quicksort method, the number inside the array from small to large in accordance with the sort, that is, incremental sequence. LcsLength function and then find the longest increasing subsequence.
To Search:
File list (Check if you may need any files):
lcsLength
.........\Debug
.........\最长单调子序列.cpp
.........\最长单调子序列.dsp
.........\最长单调子序列.dsw
.........\最长单调子序列.ncb
.........\最长单调子序列.opt
.........\最长单调子序列.plg
Download