Description: Longest increasing subsequence problem description: randomly generate a sequence of less than or equal to n natural numbers, the output of its longest increasing subsequence (any one can). n were taken 1000,3000,10000. Example: n = 5 random sequence of 51 423, the correct output is 123, ie increasing subsequence of length 3. Hint: LCS, thinking can achieve time complexity (O (nlogn
To Search:
File list (Check if you may need any files):
lab4.cpp
Download