该程序为算法分析中的一个经典问题，可以通过此程序，用动态规划的算法找出一个符序列的最长的升序子序列的并且实现了算法的最低耗费-procedures for the analysis of algorithms a classic problem, through this procedure, use dynamic programming algorithm to find a website of the longest sequence of ascending sequences of