KMP+枚举 POJ-3080 Blue Jeans
来源:互联网 发布:淘宝假物流单号怎么办 编辑:程序博客网 时间:2024/05/02 01:36
Blue Jeans
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13232 Accepted: 5884
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.
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
32GATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA3GATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATAGATACTAGATACTAGATACTAGATACTAAAGGAAAGGGAAAAGGGGAAAAAGGGGGAAAAGATACCAGATACCAGATACCAGATACCAAAGGAAAGGGAAAAGGGGAAAAAGGGGGAAAA3CATCATCATCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCACATCATCATAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACATCATCATTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT
Sample Output
no significant commonalitiesAGATACCATCATCAT
Source
South Central USA 2006
这个题是简单的字符串匹配+枚举,就可以轻松AC。
#include <iostream>#include<cstring>#include<cstdio>#define LEN 60using namespace std;int next[LEN];char dna[11][LEN];void get_next(char* a, int len){int i, temp;memset(next, 0, sizeof(next));for (i = 1; i < len; i++){temp = next[i - 1];while (temp && a[i] != a[temp]){temp = next[temp - 1];}if (a[i] == a[temp]){next[i] = temp + 1;}}}bool check(char* a, int len, int size){int i, j, k;get_next(a, len);for (k = 1; k < size; k++){j = 0;for (i = 0; i < LEN; i++){while (j > 0 && dna[k][i] != a[j]){j = next[j - 1];}if (dna[k][i] == a[j]){if (j == len - 1){break;}else{j++;}}else{j = 0;}}if (j < len - 1){return false;}}return true;}int main(){int cas, n;int i, j, len;bool flag;int start, l;char* temp;cin >> cas;while (cas--){cin >> n;for (i = 0; i < n; i++){cin >> dna[i];}flag = false;len = LEN;while (len >= 3 && !flag){j = 0;for (i = 0;; i++){if (i + len <= LEN){if (check(&dna[0][i], len, n)){flag = true;if (j == 0 || strncmp(&dna[0][i], temp, len) < 0){temp = &dna[0][i];start = i;l = len;j++;}}}else{break;}}len--;}if (flag){for (i = start; i < start + l; i++){cout << dna[0][i];}cout << endl;}else{cout << "no significant commonalities" << endl;}}return 0;}
0 0
- poj 3080 Blue Jeans kmp+枚举
- POJ 3080 Blue Jeans 暴力枚举+KMP
- POJ 3080 Blue Jeans(KMP+枚举)
- KMP+枚举 POJ-3080 Blue Jeans
- POJ 3080 Blue Jeans kmp+暴力枚举
- poj 3080 Blue Jeans 【KMP 暴力枚举】
- POJ 3080--Blue Jeans【KMP && 暴力枚举】
- (POJ 3080)Blue Jeans 枚举 + KMP
- POJ 3080 Blue Jeans KMP
- POJ 3080 Blue Jeans----kmp
- POJ 3080 Blue Jeans(KMP)
- POJ 3080 Blue Jeans KMP
- poj 3080 Blue Jeans(KMP)
- poj-3080 Blue Jeans(KMP)
- [poj 3080]Blue Jeans [kmp]
- POJ 3080 Blue Jeans KMP
- poj 3080 Blue Jeans(KMP匹配,枚举子串)
- POJ 3080 Blue Jeans(暴力枚举+kmp)
- Service 学习一
- 求先序排列 蓝桥杯
- SSIS批量导入excel表
- Javascript with
- linux-Apache 配置
- KMP+枚举 POJ-3080 Blue Jeans
- 全排列的算法(五)——邻位互换法
- EventProxy流程控制
- python实现简单爬虫功能
- UVA 11806 Cheerleaders
- KMP POJ-3461 Oulipo
- 关于LayoutInflater
- Ng在coursera上的机器学习公开课——zai总结(4)_Regularization
- php explode() -- implode(),join()