we solve the LCS (LONGEST COMMON SUBSTRİ NG ) problem in this code with two different way One of them is dynamic programming.,we solve the LCS (LONGEST COMMON SUBSTRİ NG ) problem in this code with two different way One of them is dynamic pro

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

文档包含着两部分内容：最长公共子串算法实现以及TLS（线程局部存储）的实现代码。-The document contains two parts: the longest common substring algorithm as well as the implementation of the code of the TLS (thread local storage).

字典树设集合S由若干单词（英文）组成，给定字符串K，在S中查找与K最佳匹配的结果。最佳匹配的结果定义为：与K有最长共同前缀的字符串。 例：S={abc, bdef, zhen, zhao, abdd}，K1=zhao，K2=abdf，K3=cheng，则与K1最匹配的结果是zhao，与K2最匹配的结果是abdd，与K3最匹配的结果是ε（空串）。 -Dictionary tree set S by a number of words (English), given the string