hdu1238 Substrings

#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
bool vv(const string a,const string b)
{
    return a.length()<b.length();
}
bool issub(string a,string b)
{
    for (int i=0;i<=b.length()-a.length();i++)
    {
        bool is2=1;
        for (int j=0;j < a.length();j++)
        {
            if (a[j]!=b[i+j])
            {
                is2=0;
                break;
            }
        }
        if (is2)
            return true;
    }
    return false;
}

int main()
{
    int n;cin>>n;
    while (n--)
    {
        int m;
        cin>>m;
        vector <string> v(m);
        for (int i=0;i < m;i++ )
        {
            cin>>v[i];
        }
        sort (v.begin(),v.end(),vv);
        int sum =0;
        string s = v[0];
        for (int j=0;j < s.length();j++)
        {
            for (int i=0;i<s.length();i++)
            {
                if (i <= j)
                {
                    string s2(s,i,s.length()-j);
                    bool bb=1;
                    for (int p=1;p < m;p++)
                    {
                        string vpr=v[p];
                        reverse(vpr.begin(),vpr.end());
                        if (!issub(s2,v[p]) && !issub(s2,vpr))
                        {
                            bb=0;
                            break;
                        }
                    }
                    if (bb)
                    {
                        sum = s2.length();
                        goto fuck;
                    }
                }
            }                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   
        }
        fuck:
            cout<<sum<<endl;
    }
    return 0;
} 

 

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1238

Substrings

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

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

 

 

其实就是求最大子串的，第一个进blog的题。。。先字符串长度升序排序，然后在最短的里面找子串就行了。

代码编写的比较乱，goto都用上去了~。~ 这道题尼玛做了几小时有木有啊，（其实半小时就出来了，然后WA,然后调试调试调试调试~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~最后发现少了个等号！！尼玛坑爹啊有木有，一个下午的时间都TM没了）