该程序为算法分析中的一个经典问题，可以通过此程序，用动态规划的算法找出两个字符序列的最长公共子序列-procedures for the analysis of algorithms a classic problem, through this procedure, use dynamic programming algorithm to find two characters of the longest sequence of public sequences