Location:
Search - poj 25
Search list
Description: poj上的第2533题，用dp实现求一个字符串的最长递增子序列，时间是O(n)，语言是C-poj the first 2533 title, with dp achieve demand a string of the longest increasing subsequence, the time is O (n), the language is C++
Platform: |
Size: 2048 |
Author: chenchencehn |
Hits: