该程序用于求两个序列的最长子段，通过动态规划算法，记录子问题的结果，进而求出最终的最长子段。-The procedure used to find the longest sequence of two sub-sections, through dynamic programming algorithm to record the results of sub-problems, and then find the longest sub-section final.