给出了一种基于动态规划的最长公共子串算法（vc），以及一种朴素算法。-There two Longest common substring algorithms writen in VC in this document.One is based on the dynamic programming, the other is naive.

dfs回溯方法解决0-1背包问题。 对比dp减小了空间复杂度-dfs 0- 1

DP问题 你的任务是编写一个程序，确定最高的塔猴子可以用一组给定块的建设的高度。-Your job is to write a program that determines the height of the tallest tower the monkey can build with a given set of blocks.