标题：LCS Problem 最长公共子串  
出处：Felix021
时间：Thu, 11 Jan 2007 14:47:04 +0000
作者：felix021
地址：https://www.felix021.com/blog/read.php?251

内容：
LCS Problem 最长公共子串  
 武汉大学ACM OJ第1047题 
http://acm.whu.edu.cn/noah/problem/problem.jsp?problem_id=1047 




LCS Problem 

-------------------------------------------------------------------------------- 

Time Limit:1000MS  Memory Limit:65536KB 
Total Submit:474 Accepted:98 


-------------------------------------------------------------------------------- 
  Description  

Recently, Flymouse reads a book about Algorithm and Data Structure. The book reads: there are two types of LCS Problems. One is Longest Common   
Subsequence problem. By the way of Dynamic Programming, we could solve this problem. The other is Longest Common Substring problem, which is  
to find the longest string that is substrings of the two strings. For example, given the following two strings:  
        1. flymouseEnglishpoor  
        2. comeonflymouseinenglish  
The longest common substring is flymouse, the length of this string is 8.  


Input  

The first line contains a single integer t (1 


Generated by Bo-blog 2.1.0