CSU 1608 Particle Collider（二分+后缀数组）

题意：一个子串和他的反串在所有串中的出现次数大于一半，则输出该子串，如果有多个，按字典序排序。

做法：把所有串和他的反串拼起来构造后缀数组。用一个标记数组，把正着的串的每个位置标上这个串的编号。二分长度，按照rank值大小找height>=h的最长区间，可以利用位运算来代表在正串中出现了几次，如果在正串中没出现过那么就不用加入map里了，如果出现过，我们还要把串反过来看看map里有没有，如果有说明反串字典序更小，那么就把当前的值跟原来的做一个或运算就好。最后检查下map里的值的中1的个数是否大于n/2+1。是则加入答案。

AC代码：

#pragma comment(linker, "/STACK:102400000,102400000")
#include<cstdio>
#include<ctype.h>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
#include<cstdlib>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<ctime>
#include<string.h>
#include<string>
#include<sstream>
#include<bitset>
using namespace std;
#define ll long long
#define ull unsigned long long
#define eps 1e-8
#define NMAX 30000
#define MOD 1000000007
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define PI acos(-1)
template<class T>
inline void scan_d(T &ret)
{
    char c;
    int flag = 0;
    ret=0;
    while(((c=getchar())<'0'||c>'9')&&c!='-');
    if(c == '-')
    {
        flag = 1;
        c = getchar();
    }
    while(c>='0'&&c<='9') ret=ret*10+(c-'0'),c=getchar();
    if(flag) ret = -ret;
}

int s[NMAX],t[NMAX],t2[NMAX],c[NMAX],sa[NMAX];
int Rank[NMAX],height[NMAX];
void build_sa(int n, 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[i]]++;
        for(i = 1; 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 n)
{
    int i,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;
    }
}

char str[1005];
char ch[NMAX];
int flag[NMAX];
map<string, int>mp,ans;
map<string, int>::iterator it;

inline int cal(int x)
{
    int ret = 0;
    for(int i = 1; i <= 10; i++) if(x & (1<<i))
        ret++;
    return ret;
}

int main()
{
#ifdef GLQ
    freopen("input.txt","r",stdin);
//    freopen("o.txt","w",stdout);
#endif
    int n;
    while(~scanf("%d",&n))
    {
        memset(flag,0,sizeof(flag));
        int nct = 0,da = 27;
        for(int i = 1; i <= n; i++)
        {
            scanf("%s",str);
            int len = strlen(str);
            for(int j = 0; j < len; j++)
            {
                flag[nct] = i;
                s[nct++] = str[j]-'A';
            }
            s[nct++] = da++;
            for(int j = len-1; j >= 0; j--)
                s[nct++] = str[j]-'A';
            s[nct++] = da++;
        }
        if(n == 1)
        {
            printf("%s\n",str);
            continue;
        }
        build_sa(nct,da);
        getHeight(nct);
        int l = 1,r = 1000;
        ans.clear();
        while(l <= r)
        {
            int mid = (l+r) >> 1;
            mp.clear();
            int i = 0;
            while(i < nct)
            {
                if(height[i] >= mid)
                {
                    int tmp = 1<<flag[sa[i-1]];
                    int len = 2000;
                    while(height[i] >= mid && i < nct)
                    {
                        tmp |= 1<<flag[sa[i]];
                        len = min(height[i],len);
                        i++;
                    }
                    if(tmp != 1)
                    {
                        char p1[1005],p2[1005];
                        for(int j = len-1; j >= 0; j--)
                        {
                            p1[len-1-j] = s[sa[i-1]+j]+'A';
                            p2[j] = s[sa[i-1]+j]+'A';
                        }
                        p1[len] = p2[len] = '\0';
                        if(mp.find(string(p1)) != mp.end()) mp[string(p1)] |= tmp;
                        else mp[string(p2)] = tmp;
                    }
                }
                i++;
            }
            int ha = 0;
            for(it = mp.begin(); it != mp.end(); it++)
            {
                if(cal(it->second) >= n/2+1)
                {

                    if(ha == 0)
                    {
                        ans.clear();
                        ha = 1;
                    }
                    ans.insert(*it);
                }
            }
            if(ha == 0) r = mid-1;
            else l = mid+1;
        }
        if(ans.size() == 0) printf("NONE\n");
        else
        {
            for(it = ans.begin(); it != ans.end(); it++)
                printf("%s\n",it->first.c_str());
        }
    }
    return 0;
}