POJ3294——Life Forms 后缀数组
来源:互联网 发布:sql server打开mysql 编辑:程序博客网 时间:2024/05/19 17:04
Description
You may have wondered why most extraterrestrial life forms resemble humans, differing by superficial traits such as height, colour, wrinkles, ears, eyebrows and the like. A few bear no human resemblance; these typically have geometric or amorphous shapes like cubes, oil slicks or clouds of dust.
The answer is given in the 146th episode of Star Trek - The Next Generation, titled The Chase. It turns out that in the vast majority of the quadrant's life forms ended up with a large fragment of common DNA.
Given the DNA sequences of several life forms represented as strings of letters, you are to find the longest substring that is shared by more than half of them.
Input
Standard input contains several test cases. Each test case begins with 1 ≤ n ≤ 100, the number of life forms. n lines follow; each contains a string of lower case letters representing the DNA sequence of a life form. Each DNA sequence contains at least one and not more than 1000 letters. A line containing 0 follows the last test case.
Output
For each test case, output the longest string or strings shared by more than half of the life forms. If there are many, output all of them in alphabetical order. If there is no solution with at least one letter, output "?". Leave an empty line between test cases.
Sample Input
3abcdefgbcdefghcdefghi3xxxyyyzzz0
Sample Output
bcdefgcdefgh?
求多个字符串的最长公共子串
二分后高度数组分组
#include <iostream>#include <cstring>#include <cstdio>using namespace std;const int MAX = 100500;const int nMAX = 105;const int mMAX = 1005;int strnum;char str[nMAX][mMAX];int source[MAX];int sa[MAX], rk[MAX], height[MAX];int wa[MAX], wb[MAX], wv[MAX], wd[MAX];bool vis[nMAX];int id[MAX];int anslen, anspos[mMAX], ansnum;int cmp(int* r, int a, int b, int l){return r[a] == r[b] && r[a + l] == r[b + l];}void suffix(int* r, int n, int m){int i, j;for (i = 0; i < n; ++i){//height[i] = 0;rk[i] = 0;}int p, *x = wa, *y = wb, *t;for (i = 0; i < m; ++i) wd[i] = 0;for (i = 0; i < n; ++i) wd[x[i] = r[i]]++;for (i = 1; i < m; ++i) wd[i] += wd[i - 1];for (i = n - 1; i >= 0; --i) sa[--wd[x[i]]] = i;for (j = 1, p = 1; p < n; j <<= 1, m = p){for (p = 0, i = n - j; i < n; ++i) y[p++] = i;for (i = 0; i < n; ++i) if (sa[i] >= j) y[p++] = sa[i] - j;for (i = 0; i < n; ++i) wv[i] = x[y[i]];for (i = 0; i < m; ++i) wd[i] = 0;for (i = 0; i < n; ++i) wd[wv[i]]++;for (i = 1; i < m; ++i) wd[i] += wd[i - 1];for (i = n - 1; i >= 0; --i) sa[--wd[wv[i]]] = y[i];for (t = x, x = y, y = t, p = 1, x[sa[0]] = 0, i = 1; i < n; ++i){x[sa[i]] = cmp(y , sa[i - 1], sa[i], j) ? p - 1 : p++;}}}void calheight(int* r, int n){int i, j, k = 0;for (i = 1; i <= n; ++i) rk[sa[i]] = i;for (i = 0; i < n; height[rk[i++]] = k){for (k ? k-- : 0, j = sa[rk[i] - 1]; r[i + k] == r[j + k]; ++k);}}bool solve(int beg, int end){int tot = 0;int t = strnum >> 1;for (int i = 0; i < strnum; ++i) vis[i] = false;for (int i = beg; i <= end; ++i){if (!vis[id[sa[i]]]){vis[id[sa[i]]] = true;++tot;}if (tot > t) return true;}return false;}bool group(int len, int n){bool res = false;int beg, end;beg = end = 0;for (int i = 1; i < n; ++i){if (height[i] >= len) ++end;else{if (solve(beg, end)) {if (!res) ansnum = 0;res = true;anspos[ansnum++] = sa[beg];}beg = end = i;}}if (beg < end){if (solve(beg, end)) {if (!res) ansnum = 0;res = true;anspos[ansnum++] = sa[beg];}}return res;}int main(){while (scanf("%d", &strnum) && strnum != 0){for (int i = 0; i < strnum; ++i) scanf("%s", str[i]);int n = 0, low = 1, high = 0, mid;for (int i = 0; i < strnum; ++i){int j;for (j = 0; str[i][j] != 0; ++j){id[n] = i;source[n++] = str[i][j] - 'a' + 100;}if (j > high) high = j;id[n] = i;source[n++] = i;}suffix(source, n, 126);calheight(source, n - 1);anslen = 0;while (low <= high){mid = (low + high) >> 1;if (group(mid, n)) {anslen = mid;low = mid + 1;}else high = mid - 1;}if (anslen == 0) printf("?\n");else{for (int i = 0; i < ansnum; ++i){for (int j = 0; j < anslen; ++j){printf("%c", source[anspos[i] + j] - 100 + 'a');}printf("\n");}}printf("\n");}return 0;}
- POJ3294——Life Forms 后缀数组
- POJ3294:Life Forms(后缀数组)
- 后缀数组 - poj3294 Life Forms
- poj3294 Life Forms - 后缀数组
- POJ3294 Life Forms 【后缀数组】
- 【POJ3294】Life Forms【后缀数组】【二分】
- poj3294 Life Forms(后缀数组)
- [POJ3294]Life Forms(后缀数组+二分)
- POJ3294-Life Forms(后缀数组)
- poj3294 Life Forms(后缀数组+二分答案)
- POJ3294---Life Forms(后缀数组,二分+给后缀分组)
- Life Forms poj3294
- POJ3294--Life Forms
- poj3294 Life Forms
- poj3294 Life Forms
- POJ3294-Life Forms
- Poj3294 Life Forms
- poj3294 Life Forms(后缀数组+大于k/2个字符串中含有的最长公共子串)
- 对抗神经网络模型(GANs)作为当下最火的神经网络模型
- R:绘图-彩色饼图等
- 大数据Hadoop Yarn 框架原理及运作机制_02_02
- PostgreSQL分页查询引发的思考:OutOfMemoryError
- 扪心自问,强大的UI框架,给我们带来了什么?
- POJ3294——Life Forms 后缀数组
- Eclipse快捷键
- c语言进制
- 理解RESTful架构
- Python 学习4
- java包以及finanlly关键字
- 视频检测之:利用显著运动检测的 block-sparse RPCA
- mabatis <if>
- HDU 1272 小希的迷宫 (并查集)