zoukankan      html  css  js  c++  java
  • poj3080 Blue Jeans

    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

    这题就是用暴力枚举,初看很难用枚举实现,其实复杂度不大的。

    #include<stdio.h>
    #include<string.h>
    char s[13][70],s1[70],s2[70],ss[70];
    int len[20],next[70],len1,len2;
    void nextt()
    {
    	int i,j;
    	i=0;j=-1;
    	memset(next,-1,sizeof(next));
    	while(i<len2){
    		if(j==-1 || s2[i]==s2[j]){
    			i++;j++;next[i]=j;
    		}
    		else j=next[j];
    	}
    }
    
    int kmp()
    {
    	int i,j;
    	i=0;j=0;
    	while(i<len1 && j<len2){
    		if(j==-1 || s1[i]==s2[j]){
    			i++;j++;
    		}
    		else j=next[j];
    	}
    	if(j>=len2)return 1;
    	else return 0;
    }
    
    int main()
    {
    	int n,m,i,j,T,cunzai,flag;
    	scanf("%d",&T);
    	while(T--)
    	{
    		scanf("%d",&n);
    		for(i=1;i<=n;i++){
    			scanf("%s",s[i]);
    			len[i]=strlen(s[i]);
    		}
    		cunzai=0;
    		for(len2=60;len2>=3;len2--){
    			memset(s2,0,sizeof(s2));
    			for(j=0;j<=60-len2;j++){    //枚举起点 
    				for(i=0;i<=len2-1;i++){
    					s2[i]=s[1][j+i];
    				}
    				nextt();
    				flag=1;
    				for(i=2;i<=n;i++){
    					len1=len[i];
    					strcpy(s1,s[i]);
    					if(!kmp()){
    						flag=0;break;
    					}
    				}
    				if(flag==1){
    					if(cunzai==0){
    						cunzai=1;strcpy(ss,s2);
    					}
    					else{
    						if(strcmp(ss,s2)>0)strcpy(ss,s2);
    					}
    				}
    			}
    			if(cunzai)break;
    		}
    		if(cunzai)printf("%s
    ",ss);
    		else printf("no significant commonalities
    ");
    	}
    	return 0;
    }


  • 相关阅读:
    分享一个js方法
    微信小程序中如何使用setData修改数组或对象中的某一参数
    微信小程序实现图片上传功能
    微信小程序图片上传放大预览删除代码
    小程序单张图片 和 九宫格图片上传、预览、删除示例
    微信小程序多图上传/朋友圈传图效果【附完整源码】
    shell 和awk性能对比
    超实用的8个Linux命令行性能监测工具
    storm分组模式
    Python程序的执行原理(转)
  • 原文地址:https://www.cnblogs.com/herumw/p/9464747.html
Copyright © 2011-2022 走看看