CAJ | 학술논문

介绍算法分析与设计课程中最长公共子序列问题的动态规划算法，利用该算法解决最长递减子序列问题和回文词的构造问题，通过这两个问题的求解，有助于学生举一反三，启发学生思维，以学致用，提高问题求解能力。
개소산법분석여설계과정중최장공공자서렬문제적동태규화산법，이용해산법해결최장체감자서렬문제화회문사적구조문제，통과저량개문제적구해，유조우학생거일반삼，계발학생사유，이학치용，제고문제구해능력。
This paper introduces a dynamic programming algorithm of the longest common subsequence problem in the course of analysis and design of algorithm, by use of which this paper solves the longest descending subsequence problem and the construction of the palindromic sequence problem. By solving the two problems, will help students draw inferences about other cases from one instance, inspire students’ thinking, apply their knowledge to all, improve the ability of problem solving.