hduoj1238,Substrings,搜索，练习string的使用

Substrings

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

分析：

熟练使用string的find,substr,以及反串使用reverse函数。

code：

#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
string s[100+5];
bool cmp(string s1,string s2)
{
    return s1.length()<s2.length();
}
int main()
{
    int t,n,len;
    bool ok;
    scanf("%d",&t);
    while(t--)
    {
        len=0;
        scanf("%d",&n);
        for(int i=0;i<n;i++)
            cin>>s[i];
        sort(s,s+n,cmp);
        for(int i=0;i<s[0].length();i++)
        for(int j=1;j<=s[0].length()-i;j++)
        {
            ok=true;
            string tmp=s[0].substr(i,j);
            for(int k=1;k<n;k++)
            {
                if(s[k].find(tmp)==string::npos)
                {
                    reverse(tmp.begin(),tmp.end());
                    if(s[k].find(tmp)==string::npos)
                    {
                        ok=false;
                        break;
                    }
                }
            }
            if(ok)
                if(len<j) len=j;
        }
        printf("%d\n",len);
    }
    return 0;
}