连续子串中出现超过一半次数的字符串 后缀数组 uva 11107 Life Forms

题目链接

题意：给定一些字符串，求最长并且在所有字符串的连续子串中出现超过一半次数的字符串，输出这些字符串

思路：把这些字符串接起来，拼接部分用一个不会出现的不重复的字符，然后求这个长串的后缀数组，利用height数组去进行二分求解，二分的判断里面如果有一个连续height段超过了一半次数，那么就是可行的，如果所有连续段都没有出现超过一半，就是不可行的

代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

const int maxn = 1001 * 100 + 10;

struct SuffixArray {
  int s[maxn];      // 原始字符数组（最后一个字符应必须是0，而前面的字符必须非0）
  int sa[maxn];     // 后缀数组
  int rank[maxn];   // 名次数组. rank[0]一定是n-1，即最后一个字符
  int height[maxn]; // height数组
  int t[maxn], t2[maxn], c[maxn]; // 辅助数组
  int n; // 字符个数

  void clear() { n = 0; memset(sa, 0, sizeof(sa)); }

  // m为最大字符值加1。调用之前需设置好s和n
  void build_sa(int m) {
    int i, *x = t, *y = t2;
    for(i = 0; i < m; i++) c[i] = 0;
    for(i = 0; i < n; i++) c[x[i] = s[i]]++;
    for(i = 1; i < m; i++) c[i] += c[i-1];
    for(i = n-1; i >= 0; i--) sa[--c[x[i]]] = i;
    for(int k = 1; k <= n; k <<= 1) {
      int p = 0;
      for(i = n-k; i < n; i++) y[p++] = i;
      for(i = 0; i < n; i++) if(sa[i] >= k) y[p++] = sa[i]-k;
      for(i = 0; i < m; i++) c[i] = 0;
      for(i = 0; i < n; i++) c[x[y[i]]]++;
      for(i = 0; i < m; i++) c[i] += c[i-1];
      for(i = n-1; i >= 0; i--) sa[--c[x[y[i]]]] = y[i];
      swap(x, y);
      p = 1; x[sa[0]] = 0;
      for(i = 1; i < n; i++)
        x[sa[i]] = y[sa[i-1]]==y[sa[i]] && y[sa[i-1]+k]==y[sa[i]+k] ? p-1 : p++;
      if(p >= n) break;
      m = p;
    }
  }

  void build_height() {
    int i, j, k = 0;
    for(i = 0; i < n; i++) rank[sa[i]] = i;
    for(i = 0; i < n; i++) {
      if(k) k--;
      int j = sa[rank[i]-1];
      while(s[i+k] == s[j+k]) k++;
      height[rank[i]] = k;
    }
  }
};

const int maxc = 100 + 10; // 串的个数
const int maxl = 1000 + 10; // 每个串的长度

SuffixArray sa;
int n;
char word[maxl];
int idx[maxn];
int flag[maxc];

// 子串[L,R) 是否符合要求
bool good(int L, int R) {
  memset(flag, 0, sizeof(flag));
  if(R - L <= n/2) return false;
  int cnt = 0;
  for(int i = L; i < R; i++) {
    int x = idx[sa.sa[i]];
    if(x != n && !flag[x]) { flag[x] = 1; cnt++; }
  }
  return cnt > n/2;
}

void print_sub(int L, int R) {
  for(int i = L; i < R; i++)
    printf("%c", sa.s[i] - 1 + 'a');
  printf("\n");
}

bool print_solutions(int len, bool print) {
  int L = 0;
  for(int R = 1; R <= sa.n; R++) {
    if(R == sa.n || sa.height[R] < len) { // 新开一段
      if(good(L, R)) {
        if(print) print_sub(sa.sa[L], sa.sa[L] + len); else return true;
      }
      L = R;
    }
  }
  return false;
}

void solve(int maxlen) {
  if(!print_solutions(1, false))
    printf("?\n");
  else {
    int L = 1, R = maxlen, M;
    while(L < R) {
      M = L + (R-L+1)/2;
      if(print_solutions(M, false)) L = M;
      else R = M-1;
    }
    print_solutions(L, true);
  }
}

// 给字符串加上一个字符，属于字符串i
void add(int ch, int i) {
  idx[sa.n] = i;
  sa.s[sa.n++] = ch;
}

int main() {
  int kase = 0;
  while(scanf("%d", &n) == 1 && n) {
    if(kase++ > 0) printf("\n");
    int maxlen = 0;
    sa.clear();
    for(int i = 0; i < n; i++) {
      scanf("%s", word);
      int sz = strlen(word);
      maxlen = max(maxlen, sz);
      for(int j = 0; j < sz; j++)
        add(word[j] - 'a' + 1, i);
      add(100 + i, n); // 结束字符
    }
    add(0, n);

    if(n == 1) printf("%s\n", word);
    else {
      sa.build_sa(100 + n);
      sa.build_height();
      solve(maxlen);
    }
  }
  return 0;
}

#include <cstdio>  
#include <cstring>  
#include <algorithm>  
#include <set>  
using namespace std;  
  
const int MAXLEN = 200005;  
  
struct Suffix {  
  
    int s[MAXLEN];  
    int sa[MAXLEN], t[MAXLEN], t2[MAXLEN], c[MAXLEN], n;  
    int rank[MAXLEN], height[MAXLEN];  
  
    void build_sa(int m) {  
    int i, *x = t, *y = t2;  
    for (i = 0; i < m; i++) c[i] = 0;  
    for (i = 0; i < n; i++) c[x[i] = s[i]]++;  
    for (i = 1; i < m; i++) c[i] += c[i - 1];  
    for (i = n - 1; i >= 0; i--) sa[--c[x[i]]] = i;  
    for (int k = 1; k <= n; k <<= 1) {  
        int p = 0;  
        for (i = n - k; i < n; i++) y[p++] = i;  
        for (i = 0; i < n; i++) if (sa[i] >= k) y[p++] = sa[i] - k;  
        for (i = 0; i < m; i++) c[i] = 0;  
        for (i = 0; i < n; i++) c[x[y[i]]]++;  
        for (i = 0; i < m; i++) c[i] += c[i - 1];  
        for (i = n - 1; i >= 0; i--) sa[--c[x[y[i]]]] = y[i];  
        swap(x, y);  
        p = 1; x[sa[0]] = 0;  
        for (i = 1; i < n; i++)  
        x[sa[i]] = y[sa[i - 1]] == y[sa[i]] && y[sa[i - 1] + k] == y[sa[i] + k] ? p - 1 : p++;  
        if (p >= n) break;  
        m = p;  
    }         
    }  
  
    void getHeight() {  
    int i, j, k = 0;  
    for (i = 0; i < n; i++) rank[sa[i]] = i;  
    for (i = 0; i < n; i++) {  
        if (k) k--;  
        if (rank[i] == 0) continue;  
        int j = sa[rank[i] - 1];  
        while (s[i + k] == s[j + k]) k++;  
        height[rank[i]] = k;  
    }  
    }  
} gao;  
  
const int N = 1005;  
  
int n, l, r, id[MAXLEN];  
char str[N];  
  
bool judge(int x, int bo) {  
    set<int> vis;      
    vis.insert(id[gao.sa[1]]);  
    for (int i = 2; i < gao.n; i++) {  
    while (i < gao.n && gao.height[i] >= x) {  
        vis.insert(id[gao.sa[i]]);  
        i++;  
    }  
    if (vis.size() * 2 > n) {  
        if (bo == 0)  
        return true;  
        for (int j = 0; j < x; j++)  
        printf("%c", gao.s[gao.sa[i - 1] + j]);  
        printf("\n");  
    }  
    vis.clear();  
    vis.insert(id[gao.sa[i]]);  
    }  
    return false;  
}  
  
void solve() {  
    if (!judge(1, 0)) {  
    printf("?\n");  
    return;  
    }  
    l = 1; r++;  
    while (l < r) {  
    int mid = (l + r) / 2;  
    if (judge(mid, 0)) l = mid + 1;  
    else r = mid;  
    }  
    l--;  
    judge(l, 1);  
}  
  
int main() {  
    int bo = 0;  
    while (~scanf("%d", &n) && n) {  
    if (bo) printf("\n");  
    else bo = 1;  
    if (n == 1) {  
        scanf("%s", str);  
        printf("%s\n", str);  
        continue;  
    }  
    int tot = 0;  
    r = 0;  
    for (int i = 0; i < n; i++) {  
        scanf("%s", str);  
        int len = strlen(str);  
        r = max(len, r);  
        for (int j = 0; j < len; j++) {  
        id[tot] = i;  
        gao.s[tot++] = str[j];  
        }  
        id[tot] = i;  
        gao.s[tot++] = 'z' + i + 1;  
    }  
    gao.n = tot;  
    gao.build_sa('z' + n + 1);  
    gao.getHeight();  
    solve();  
    }  
    return 0;  
}