Description: 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++
File list (Check if you may need any files):
2533dp最长递增子序列\2533.dsp
....................\2533.plg
....................\1.txt
....................\2533.cpp
....................\2533.dsw
2533dp最长递增子序列
Download