poj3080 Blue Jeans

Blue Jeans

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 16367		Accepted: 7263

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

看了题原理懂，就是找M个串中最大公共子串，当串长度一样时，选择一个字典序小的。

当时一看没有什么思路，心想是不是需要什么KMP之类的，结果，看了一下别人的，原来暴力就可以达到0MS的效果。想想之后一个串的长度是60.列举完第一个子串相当于要（60+1）*30。然后再去遍历最多9个串也就16470.....才跑10000肯定不会超时。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <cstring>
#include <string>
using namespace std;
const int MAXN=10005;
char s[10][100];
char zi[100];
char ans[100];
int main()
{
    int t;
    int i,j,k;
    int n;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        int ansl=0;
        for(i=0;i<n;++i)scanf("%s",s[i]);
        int l=60;
        for(i=1;i<=l;++i)
        {
            for(j=0;j<=l-i;++j)
            {
                for(k=0;k<i;++k)
                {
                    zi[k]=s[0][j+k];
                }
                zi[k]=0;
                int ok=1;
                for(k=1;k<n;++k)
                {
                    if(!strstr(s[k],zi))
                    {
                        ok=0;
                        break;
                    }
                }
                if(ok)
                {
                    if(ansl<i)
                    {
                        ansl=i;
                        strcpy(ans,zi);
                    }
                    else
                        if(ansl==i)
                    {
                        if(strcmp(ans,zi)>0)strcpy(ans,zi);
                    }

                }
            }
        }

        if(ansl<3)printf("no significant commonalities\n");
        else printf("%s\n",ans);
    }
    return 0;
}

论看题目范围的重要性QAQ