POJ1226(strstr)

Substrings

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 13348		Accepted: 4722

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 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 
直接暴力枚举。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char s[][];
int n;
int solve()
{
    char sub[];
    char rsub[];
    int len=strlen(s[]);
    int cnt=;
    for(int l=len;l>;l--)
    {
        for(int x=;x+l<=len;x++)
        {
            memset(sub,,sizeof(sub));
            memset(rsub,,sizeof(rsub));
            strncpy(sub,s[]+x,l);
            strcpy(rsub,sub);
            reverse(rsub,rsub+strlen(rsub));
            cnt=;
            for(int i=;i<n;i++)
            {
                if(strstr(s[i],sub)!=NULL||strstr(s[i],rsub)!=NULL)
                {
                    cnt++;
                }
                else    break;
            }
            if(cnt==n-)    return strlen(sub);
        }
    }
    return ;
}
int main()
{
    int cas;
    scanf("%d",&cas);
    while(cas--)
    {
        scanf("%d",&n);
        memset(s,,sizeof(s));
        for(int i=;i<n;i++)
        {
            scanf("%s",s[i]);
        }
        printf("%d\n",solve());
    }
    return ;
}