POJ 3080 Blue Jeans（暴力枚举+kmp）

Time Limit: 1000MS Memory Limit: 65536K

Description
The Genographic Project is a research partnership between IBM and The National Geographic Society that is analyzing DNA from hundreds of thousands of contributors to map how the Earth was populated.

As an IBM researcher, you have been tasked with writing a program that will find commonalities amongst given snippets of DNA that can be correlated with individual survey information to identify new genetic markers.

A DNA base sequence is noted by listing the nitrogen bases in the order in which they are found in the molecule. There are four bases: adenine (A), thymine (T), guanine (G), and cytosine (C). A 6-base DNA sequence could be represented as TAGACC.

Given a set of DNA base sequences, determine the longest series of bases that occurs in all of the sequences.

Input
Input to this problem will begin with a line containing a single integer n indicating the number of datasets. Each dataset consists of the following components:
A single positive integer m (2 <= m <= 10) indicating the number of base sequences in this dataset.
m lines each containing a single base sequence consisting of 60 bases.

Output
For each dataset in the input, output the longest base subsequence common to all of the given base sequences. If the longest common subsequence is less than three bases in length, display the string “no significant commonalities” instead. If multiple subsequences of the same longest length exist, output only the subsequence that comes first in alphabetical order.

Sample Input
3
2
GATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
3
GATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATA
GATACTAGATACTAGATACTAGATACTAAAGGAAAGGGAAAAGGGGAAAAAGGGGGAAAA
GATACCAGATACCAGATACCAGATACCAAAGGAAAGGGAAAAGGGGAAAAAGGGGGAAAA
3
CATCATCATCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
ACATCATCATAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AACATCATCATTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT

Sample Output
no significant commonalities
AGATAC
CATCATCAT

题意： 给你n个字符串，求n个字符串的最长公共子串，如果公共子串的长度小于三，就输出“”no significant commonalities“”,否则输出最长公共子串。

思路： 这道题的数据比较小，其实直接暴力再加个优化就好，但是因为是做kmp的专题，所以就用了kmp，不过也就只是用来优化而已，直接暴力枚举出第一个串的所有子串，然后再进行匹配，匹配的时候用kmp，然后因为kmp写挫了卡了好久·············做完这道题感觉kmp又涨姿势了。

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<vector>
#include<string>
#include<queue>
#include<map>
#include<stack>
#include<set>
#define ll long long
#define maxn 200010
const int mod=1e9+7;
using namespace std;
string str[15];
string ans;
int f[70];
int T,n;
void makenext(string a,int len)       //生成next数组，方便匹配
{
    memset(f,0,sizeof(f));
    int i=0;
    int j=-1;
    f[0]=-1;
    while(i<len)
    {
        if(j==-1||a[i]==a[j])      //以-1开头的next数组
        {
            i++;
            j++;
            f[i]=j;
        }
        else j=f[j];
    }
}
bool makekmp(string a,string b)
{
    int lena=a.length();
    int lenb=b.length();
    makenext(a,lena);
    int i=0;
    int j=0;
    while(i<lenb)
    {
        if(j==-1||a[j]==b[i])       //注意，当j等于-1的时候也要进入这个判断，要不然匹配无法顺利进行
        {
            i++;
            j++;
        }
        else  j=f[j];
        if(j==lena)  return true;
    }
    return false;
}
int main()
{
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        for(int i=0;i<n;i++)  cin>>str[i];
        int len=str[0].length();

        ans="";
        for(int i=0;i<len;i++)
        {
            for(int j=1;i+j-1<len;j++)
            {
                string tmp=str[0].substr(i,j);

                int flag=0;
                for(int k=1;k<n;k++)
                {
                    if(!makekmp(tmp,str[k]))
                    {
                        flag=1;
                        break;
                    }
                }
                if(!flag)
                {
                    if(tmp.length()>ans.length())  ans=tmp;
                    else if(tmp.length()==ans.length()&&tmp<ans)  ans=tmp;
                }
            }
        }
        if(ans.length()<3)  printf("no significant commonalities\n");
        else  cout<<ans<<endl;
    }

    return 0;
}