搜索（字符串暴力）

PROBLEM   LINK：http://acm.hdu.edu.cn/showproblem.php?pid=1238

Problem：

Substrings

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7368    Accepted Submission(s): 3320

Problem Description

You are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its inverse can be found as a substring of any of the given strings.

 

Input

The first line of the input file contains a single integer t (1 <= t <= 10), the number of test cases, followed by the input data for each test case. The first line of each test case contains a single integer n (1 <= n <= 100), the number of given strings, followed by n lines, each representing one string of minimum length 1 and maximum length 100. There is no extra white space before and after a string. 

 

Output

There should be one line per test case containing the length of the largest string found.

 

Sample Input

  
  

   
   2
3
ABCD
BCDFF
BRCD
2
rose
orchid
  
  

 

Sample Output

  
  

   
   2
2
  
  

 

Author

Asia 2002, Tehran (Iran), Preliminary

 

code：

#include<stdio.h>
#include<string.h>
char s[111][111],s1[111],s2[111];
int min,max,len;
int main()
{
int i,j,k,n,t,fg,cnt,m,h;
while(scanf("%d",&t)!=EOF)
{
while(t--)
{
scanf("%d",&n);
min=1000;
max=0;
for(i=1;i<=n;i++)
{
scanf("%s",s[i]);
            len=strlen(s[i]);
if(len<min)
{
min=len;
fg=i;
}
}
for(i=0;i<min;i++)
{
for(j=i;j<min;j++)
{
cnt=j-i+1;
m=0;
for(k=i;k<=j;k++)
{
s1[m++]=s[fg][k];
s2[cnt-m]=s[fg][k];
}
s1[m]='\0';
s2[m]='\0';
for(h=1;h<=n;h++)
{
if(h==fg)
continue;
if(!strstr(s[h],s1)&&!strstr(s[h],s2))
{
break;
}
}
if(h==n+1&&m>max)
{
max=m;
}
}
}
printf("%d\n",max);
}
}
return 0;
}