Life Forms 【POJ - 3294】【后缀数组+尺取】

题目链接

---

  我们这次要查询的是N个串中出现次数大于一半的串的子串的最大长度，并且按照升序输出所有满足这个最大长度的这样的子串。

  所以还是使用到了后缀数组，但是问题来了，我们可以很方便的处理出来最大长度（尺取+区间最小查询），然后就是如果遇到了3个“aa”，我们的输出中会两次输出“aa”这当然是output所不允许的！

  我们在处理相同串的时候考虑到，相同的前缀，一定是连着出现的，也就是说，它们一定连着出现，并且第ans_len位是相等的，这样，我们就可以来判断它是否是相同的子串了，就可以有效的避免它了。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
//#include <unordered_map>
//#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 1e5 + 107;
struct SA
{
    int n, m;
    int s[maxN];
    int y[maxN], x[maxN], c[maxN], sa[maxN], rk[maxN], height[maxN];
    inline void get_SA()
    {
        for(int i=1; i<=m; i++) c[i] = 0;   //桶的初始化
        for(int i=1; i<=n; i++) ++c[x[i] = s[i]];
        for(int i=2; i<=m; i++) c[i] += c[i - 1];   //利用差分前缀和的思想知道每个关键字最多是在第几名
        for(int i=n; i>=1; i--) sa[c[x[i]]--] = i;
        for(int k=1; k<=n; k<<=1)
        {
            int num = 0;
            for(int i=n - k + 1; i<=n; i++) y[++num] = i;
            for(int i=1; i<=n; i++) if(sa[i] > k) y[++num] = sa[i] - k; //是否可以作为第二关键字
            for(int i=1; i<=m; i++) c[i] = 0;
            for(int i=1; i<=n; i++) c[x[i]]++;  //因为上一次循环已经求出这次的第一关键字了
            for(int i=2; i<=m; i++) c[i] += c[i - 1];
            for(int i=n; i>=1; i--) //在同一第一关键字下，按第二关键字来排
            {
                sa[c[x[y[i]]]--] = y[i];
                y[i] = 0;
            }
            swap(x, y);
            x[sa[1]] = 1; num = 1;
            for(int i=2; i<=n; i++)
            {
                x[sa[i]] = (y[sa[i]] == y[sa[i - 1]] && y[sa[i] + k] == y[sa[i - 1] + k]) ? num : ++num;
            }
            if(num == n) break;
            m = num;
        }
    }
    inline void get_height()
    {
        int k = 0;
        for(int i=1; i<=n; i++) rk[sa[i]] = i;
        for(int i=1; i<=n; i++)
        {
            if(rk[i] == 1) continue;    //第一名的height为0
            if(k) k--;  //height[i] >= height[i - 1] - 1
            int j = sa[rk[i] - 1];
            while(j + k <= n && i + k <= n && s[i + k] == s[j + k]) k++;
            height[rk[i]] = k;
        }
    }
    inline void clear()
    {
        n = 0; m = 5000;
    }
} sa;
int N, len, str_end[maxN], have_to, now_get;
int vis[maxN];
char s[1005];
struct BIT_Tree
{
    int tree[maxN << 2];
    inline void buildTree(int rt, int l, int r)
    {
        if(l == r)
        {
            tree[rt] = sa.height[l];
            return;
        }
        int mid = HalF;
        buildTree(Lson); buildTree(Rson);
        tree[rt] = min(tree[lsn], tree[rsn]);
    }
    inline int query(int rt, int l, int r, int ql, int qr)
    {
        if(ql <= l && qr >= r) return tree[rt];
        int mid = HalF;
        if(qr <= mid) return query(QL);
        else if(ql > mid) return query(QR);
        else return min(query(QL), query(QR));
    }
}tree;
int main()
{
    int Cas = 0;
    while(scanf("%d", &N) && N)
    {
        if(Cas++) puts("");
        sa.clear(); have_to = N / 2 + 1; now_get = 0; for(int i=1; i<=N; i++) vis[i] = 0;
        for(int i=1; i<=N; i++)
        {
            scanf("%s", s + 1);
            len = (int)strlen(s + 1);
            for(int j=1; j<=len; j++) sa.s[++sa.n] = s[j];
            str_end[i] = sa.n;
            sa.s[++sa.n] = 'a' + 25 + i;
        }
        if(N == 1)
        {
            for(int i=1; i<=len; i++) printf("%c", s[i]); puts("");
            continue;
        }
        sa.get_SA();
//        for(int i=1; i<=sa.n; i++) printf("%d ", sa.sa[i]); puts("");
        sa.get_height();
//        for(int i=1; i<=sa.n; i++) printf("%d ", sa.height[i]); puts("");
        tree.buildTree(1, 2, sa.n);
        int l = 1, r = 1, ans_len = 0, tmp_id;
        while(now_get < have_to)
        {
            tmp_id = (int)(lower_bound(str_end + 1, str_end + N + 1, sa.sa[r]) - str_end);
            if(!vis[tmp_id]) now_get++;
            vis[tmp_id]++;
            r ++;
        }
        tmp_id = (int)(lower_bound(str_end + 1, str_end + N + 1, sa.sa[l]) - str_end);
        while(vis[tmp_id] > 1)
        {
            l++;
            vis[tmp_id]--;
            tmp_id = (int)(lower_bound(str_end + 1, str_end + N + 1, sa.sa[l]) - str_end);
        }
        ans_len = tree.query(1, 2, sa.n, l + 1, r - 1);
        while(r <= sa.n - N)
        {
            tmp_id = (int)(lower_bound(str_end + 1, str_end + N + 1, sa.sa[r]) - str_end);
            if(!vis[tmp_id]) now_get++;
            vis[tmp_id]++;
            tmp_id = (int)(lower_bound(str_end + 1, str_end + N + 1, sa.sa[l]) - str_end);
            while(now_get > have_to || vis[tmp_id] > 1)
            {
                vis[tmp_id]--;
                if(!vis[tmp_id]) now_get--;
                l++;
                tmp_id = (int)(lower_bound(str_end + 1, str_end + N + 1, sa.sa[l]) - str_end);
            }
            ans_len = max(ans_len, tree.query(1, 2, sa.n, l + 1, r));
            r++;
        }
        if(!ans_len)
        {
            printf("?\n");
            continue;
        }
        /*----------------------*/
        int now_len = 0, las_beg = 0;
        l = 1; r = 1; now_get = 0;
        for(int i=1; i<=N; i++) vis[i] = 0;
        while(now_get < have_to)
        {
            tmp_id = (int)(lower_bound(str_end + 1, str_end + N + 1, sa.sa[r]) - str_end);
            if(!vis[tmp_id]) now_get++;
            vis[tmp_id]++;
            r ++;
        }
        tmp_id = (int)(lower_bound(str_end + 1, str_end + N + 1, sa.sa[l]) - str_end);
        while(vis[tmp_id] > 1)
        {
            l++;
            vis[tmp_id]--;
            tmp_id = (int)(lower_bound(str_end + 1, str_end + N + 1, sa.sa[l]) - str_end);
        }
        now_len = tree.query(1, 2, sa.n, l + 1, r - 1);
        bool out_put_limit = false;
        if(now_len == ans_len)
        {
            for(int i=sa.sa[r - 1]; i<sa.sa[r - 1] + ans_len; i++) printf("%c", sa.s[i]); puts("");
            out_put_limit = true; las_beg = sa.sa[r - 1];
        }
        while(r <= sa.n - N)
        {
            tmp_id = (int)(lower_bound(str_end + 1, str_end + N + 1, sa.sa[r]) - str_end);
            if(!vis[tmp_id]) now_get++;
            vis[tmp_id]++;
            tmp_id = (int)(lower_bound(str_end + 1, str_end + N + 1, sa.sa[l]) - str_end);
            while(now_get > have_to || vis[tmp_id] > 1)
            {
                vis[tmp_id]--;
                if(!vis[tmp_id]) now_get--;
                l++;
                tmp_id = (int)(lower_bound(str_end + 1, str_end + N + 1, sa.sa[l]) - str_end);
            }
            now_len = tree.query(1, 2, sa.n, l + 1, r);
            if(now_len == ans_len)
            {
                if(out_put_limit && sa.s[las_beg + ans_len - 1] == sa.s[sa.sa[r] + ans_len - 1]) { r++; continue; }
                for(int i=sa.sa[r]; i<sa.sa[r] + ans_len; i++) printf("%c", sa.s[i]); puts("");
                out_put_limit = true; las_beg = sa.sa[r];
            }
            else out_put_limit = false;
            r++;
        }
    }
    return 0;
}
/*
3
aab
aa
aac
ans:aa
*/