Blue Jeans
| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 20966 | Accepted: 9279 |
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
Source
题目意思：
给你n个字符串，要你找这n个字串的最长公共字串
如果最长公共字串的长度相同，输出字典序最小的那个
如果最长公共字串的长度小于3输出指定语句
分析：
直接在第一个串枚举模板串（短的）的长度和起点
然后在剩余的n-1个串里面匹配
匹配到了的话，保存下来，但值保存最长的那个，相同长度的保存字典序最小的那个
注意：
min函数比较字符串的话，可以按照字典序比较！！！！
code：
#include<cstdio>
#include<iostream>
#include<cstring>
#include<memory>
#include<algorithm>
using namespace std;
#define mod 360000
string a,b[];
int next1[];
int sum;
void getnext(string s,int next1[],int m)
{
next1[]=;
next1[]=;
for(int i=; i<m; i++)
{
int j=next1[i];
while(j&&s[i]!=s[j])
j=next1[j];
if(s[i]==s[j])
next1[i+]=j+;
else
next1[i+]=;
}
}
int kmp(string ss,string s,int next1[],int n,int m)
{
getnext(s,next1,m);
int j=;
for(int i=; i<n; i++)
{
while(j&&s[j]!=ss[i])
j=next1[j];
if(s[j]==ss[i])
j++;
if(j==m)
{
return ;
}
}
return ;
}
int main()
{
int t;
string ans;
scanf("%d",&t);
while(t--)
{
ans="";
int n;
scanf("%d",&n);
for(int i=; i<n; i++)
cin>>b[i];
int l=b[].size();
for(int i=; i<=l; i++)//字串长度
{
for(int j=; j<=l-i; j++)//字串起点
{
a=b[].substr(j,i);//substr 起点是j，长度为i
bool flag=;
for(int k=; k<n; k++)
{
if(!kmp(b[k],a,next1,b[k].size(),a.size()))
flag=;
}
if(flag)
{
if(ans.size()<a.size())
ans=a;
else if(ans.size()==a.size())
ans=min(ans,a);
}
}
}
if(ans.size()<)
printf("no significant commonalities\n");
else
cout<<ans<<endl;
}
return ;
}