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