Description: The so-called sub-sequences, that is deleted in the original sequence in a number of elements remaining after the sequence to the string abcdefg , for example, be removed BDE sequence acfg This program can be obtained it the longest monotonically increasing sequence .
To Search:
- [1] - design an O (n2) time algorithm to ident
File list (Check if you may need any files):
新建 文本文档 (4).txt
Download