poj 3080 串 (连续子串用枚举)

最新推荐文章于 2019-08-27 17:02:23 发布

lisendong0126

最新推荐文章于 2019-08-27 17:02:23 发布

阅读量596

点赞数

分类专栏： acm字符串字符串算法

本文链接：https://blog.csdn.net/A775700879/article/details/12998457

版权

acm字符串字符串算法专栏收录该内容

5 篇文章 0 订阅

订阅专栏

Blue Jeans

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 10472		Accepted: 4454

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

South Central USA 2006

刚开始想了半天复杂算法，想到kmp，还想到最长公共子序列。

仔细思考，发现最长公共子序列那种题目是针对非连续公共子序列的。并不是子串。

对于一个字符串的非连续子序列，可能的情况是 2^60，无法枚举。

而对于该题目，连续子串只有60 + 59 + 58 + .... + 1 = 1830种。

因此枚举即可完全搞定。比较次数大约为: 60 * 9 * 1 * 60 + 59 * 9 * 2 * 59 + 58 * 9 * 3 * 58 .... + 1 * 9 * 60 * 1. 总的比较次数应该也不会超过10W次。

提交记录：

1.Wrong Answer。。。居然是因为题目中说的是 less than three的输出 no significant, 而我程序中写的是 <=.....

2.Accepted.

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
         #include 
        
          #include 
         
           #include 
          
            #include 
            #define MAX_V 500 #define oo 0x3f3f3f3f using namespace std; int n, m; char s[20][100]; int main() { cin >> n; int i, j, k; for (i = 0; i < n; i++) { cin >> m; for (j = 0; j < m; j++) { cin >> s[j]; } string result; for (k = 1; k <= 60; k++) { for (j = 0; j + k <= 60; j++) { char tmp[100]; strncpy(tmp, &s[0][j], k); tmp[k] = 0; int o; for (o = 1; o < m; o++) { if (strstr(s[o], tmp) == NULL) break; } if (o == m) { string a = tmp; if (a.size() > result.size()) { result = a; } else if (a.size() == result.size()) { if (a < result) result = a; } } } } if (result.size() >= 3) cout << result << endl; else cout << "no significant commonalities" << endl; } return 0; }

lisendong0126

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
poj 3080 串 (连续子串用枚举)

Blue JeansTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10472 Accepted: 4454DescriptionThe Genographic Project is a research partnership between IBM and
复制链接

扫一扫

专栏目录