最长公共子串问题
Time Limit:1000MS Memory Limit:65536KB
Description
所谓最长公共子串,比如串A "acedfe", 串B "aede", 则它们的最长公共子串为串 "aede", 即不论串中字符是否相邻,只要它是给定各个串都包含的,且长度最长的串。给定两个不包含空格的字符串和一整数n , 如果最长公共串长度大于或等于n,输出Not Smaller, 否则输出Smaller.
Input
第一行仅一个整数N,(1<= N <= 100).表示包含N个测试样例.
每个测试样例由两个字符串A,B( 0< strlen(A),strlen(B) <= 1000) 和一个整数n( 0 <= n <= 1000)构成.
Output
对于每个测试样例,输出Not Smaller 或 Smaller.
Sample Input
3
acedsd
acdd
2
eedfd
zzxxxx
3
feefs
as
1
Sample Output
Not Smaller
Smaller
Not Smaller
用二维数组记录a长度为i,b长度为j时最长公共子串的长度。maze[i][j]的更新方式有两种情况:①a[i] == b[i],此时maze[i][j] =max(maze[i - 1][j] , maze[i][j - 1] , maze[i - 1][j - 1] + 1);②a[i] != b[i],此时maze[i][j] = max(maze[i - 1][j] , maze[i][j - 1] , maze[i - 1][j - 1]).以下举例说明填充maze[i][j]的方法:
a b c d
0 0 0 0 0
a 0 1 1 1 1
b 0 1 2 2 2
e 0 1 2 2 2
d 0 1 2 2 3
代码:
<span style="font-size:14px;">#include"cstdio"
#include"cstring"
#include"iostream"
#include"algorithm"
using namespace std;
char a[1005],b[1005];
int maze[1005][1005];
int main()
{
int cas;
while(~scanf("%d",&cas))
{
int n;
while(cas--)
{
scanf("%s%s%d",a,b,&n);
int la = strlen(a);
int lb = strlen(b);
for(int i = 0;i <= la;i++)
{
for(int j = 0;j <= lb;j++)
{
maze[i][j] = 0;
}
}
for(int i = 1;i <= la;i++)
{
for(int j = 1;j <= lb;j++)
{
if(a[i - 1] == b[j - 1])
{
maze[i][j] = maze[i - 1][j - 1] + 1; //a[i] == b[i]时,由对角线更新maze
}
else
{
maze[i][j] = max(maze[i - 1][j],maze[i][j - 1]); //a[i] != b[i]时,左下右上取较大
}
}
}
if(maze[la][lb] >= n)
{
cout << "Not Smaller" << endl;
}
else
{
cout << "Smaller" << endl;
}
}
}
return 0;
}
</span>