Blue Jeans
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 ©. 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
题意:找最长公共子串。
直接在最短的串中找子串
和HDU -1238 Substrings(暴力枚举每个子串)一样
#include <stdio.h>
#include <string.h>
char a[105][105];
int main()
{
int n;
scanf("%d", &n);
while(n--)
{
int t, i, minlen=105;
char zheng[105], s[105];
scanf("%d", &t);
for(i=0; i<t; i++)
{
scanf("%s", a[i]);
if(strlen(a[i])<minlen)
{
minlen=strlen(a[i]);//找最短的
strcpy(s, a[i]);
}
}
char ans[105];
ans[0]='z';
int slen=minlen;
int flag_find, flag_ans;//子串是否是公共串的标志,找到答案的标志
while(slen!=0)//遍历最短串的每个长度
{
flag_ans=0;
for(int k=0; k<=minlen-slen; k++)//在slen长度内共有minlen-slen种组成子串的方式
{
flag_find=1;
for(int j=0; j<slen; j++)//获得子串
zheng[j]=s[j+k];
zheng[slen]='\0';//当心RE
for(int j=0; j<t; j++)//检查是否匹配
{
if(strstr(a[j], zheng)==NULL)//没找到
{
flag_find=0;
break;
}
}
if(flag_find&&zheng[0]<ans[0])//如果是公共子串且首字母字典排序更小
strcpy(ans, zheng), flag_ans=1;
}
if(flag_ans==1)//如果找到答案
break;
slen--;//这个长度的都不行,-1
}
if(slen<3)
printf("no significant commonalities\n");
else
printf("%s\n", ans);
}
return 0;
}