hd1238

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.

题目大意就是一组字符串，找出其中最短的，它本身或者它的反串的任意子串中，同时为该组其他所有串的子串，最长的那一个。

 

首先求最短串并标记，再求它本身或它反串的任意子串，再拿该子串与原来那一组中所有串进行比较，记录公共子串的长度，最后得到最大值。

#include<stdio.h>
#include<string.h>
int min=0x3f3f3f3f;
int main()
{
	int n,m,len,flag,lens,sign,max;
	char str[101][101],s1[101],s2[101];
	scanf("%d",&n);
	while(n--)
	{
		scanf("%d",&m);
		for(int i=0;i<m;++i)/求最短串
		{
			scanf("%s",str[i]);
			len=strlen(str[i]);
			if(len<min)
			{
				min=len;
				flag=i;
			}
		}
		len=strlen(str[flag]);max=0;sign=1; //求子串
		for(int i=0;i<len;++i)//子串头
		{
			for(int j=i;j<len;++j)//子串尾
			{
				for(int k=i;k<=j;++k)
				{
					s1[k-i]=str[flag][k];同一字符在s1从前往后放，在s2从后往前放
					s2[j-k]=str[flag][k];
				}
				s1[j-i+1]=s2[j-i+1]='\0';
				lens=strlen(s1);
				for(int k=0;k<m;++k)//与所有字串比较
				{
					if(!strstr(str[k],s1)&&!strstr(str[k],s2))
					{
						sign=0;break;
					}
				}
				if(lens>max&&sign)max=lens;//求最长子串
				sign=1;
			}
		}
		printf("%d\n",max);
	}
	return 0;
}