这个包括了 ACM比赛中 经常会用到的动态递归算法的一些经典例题，例如背包问题，最长公共子序列等的源代码-This includes the classic example of the dynamic recursive algorithm is often used in the ACM competition, such as the knapsack problem, the longest common subsequence such as source code