求最长的公共子序列，对于初学者来说很不错

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++

poj 2533 Longest Ordered Subsequence 简单的动态规划题目-poj 2533 Longest Ordered Subsequence simple dynamic programming topics