POJ - 3693(后缀数组)

讲解：https://blog.csdn.net/queuelovestack/article/details/53035903

#include <cstdio>
#include <cstring>
#include<iostream>
#include <algorithm>
#include<cmath>
#define F(x) ((x) / 3 + ((x) % 3 == 1 ? 0 : tb))
#define G(x) ((x) < tb ? (x) * 3 + 1 : ((x) - tb) * 3 + 2)
#define ll long long
using namespace std;
const int N = 3*(1e5+5);
int wa[N], wb[N], wss[N], wv[N], sa[N];
int rak[N], height[N], cal[N],n;
char s[N],ans[N],s1[N];
int cnt[N];
int f[100005][18]; 
int c0(int *r, int a, int b) {
    return r[a] == r[b] && r[a + 1] == r[b + 1] && r[a + 2] == r[b + 2];
}
int c12(int k, int *r, int a, int b) {
    if (k == 2)
        return r[a] < r[b] || r[a] == r[b] && c12(1, r, a + 1, b + 1);
    return r[a] < r[b] || r[a] == r[b] && wv[a + 1] < wv[b + 1];
}
void Rsort(int *r, int *a, int *b, int n, int m) {
    for (int i = 0; i < n; i++) wv[i] = r[a[i]];
    for (int i = 0; i < m; i++) wss[i] = 0;
    for (int i = 0; i < n; i++) wss[wv[i]]++;
    for (int i = 1; i < m; i++) wss[i] += wss[i - 1];
    for (int i = n - 1; i >= 0; i--) b[--wss[wv[i]]] = a[i];
}
void dc3(int *r, int *sa, int n, int m) {
    int i, j, *rn = r + n, *san = sa + n, ta = 0, tb = (n + 1) / 3, tbc = 0, p;
    r[n] = r[n + 1] = 0;
    for (i = 0; i < n; i++) if (i % 3 != 0) wa[tbc++] = i;
    Rsort(r + 2, wa, wb, tbc, m);
    Rsort(r + 1, wb, wa, tbc, m);
    Rsort(r, wa, wb, tbc, m);
    for (p = 1, rn[F(wb[0])] = 0, i = 1; i < tbc; i++)
        rn[F(wb[i])] = c0(r, wb[i - 1], wb[i]) ? p - 1 : p++;
    if (p < tbc) dc3(rn, san, tbc, p);
    else for (i = 0; i < tbc; i++) san[rn[i]] = i;
    for (i = 0; i < tbc; i++) if (san[i] < tb) wb[ta++] = san[i] * 3;
    if (n % 3 == 1) wb[ta++] = n - 1;
    Rsort(r, wb, wa, ta, m);
    for (i = 0; i < tbc; i++) wv[wb[i] = G(san[i])] = i;
    for (i = 0, j = 0, p = 0; i < ta && j < tbc; p++)
        sa[p] = c12(wb[j] % 3, r, wa[i], wb[j]) ? wa[i++] : wb[j++];
    for (; i < ta; p++) sa[p] = wa[i++];
    for (; j < tbc; p++) sa[p] = wb[j++];
}
void calheight(int *r, int *sa, int n) {
    int i, j, k = 0;
    for (i = 1; i <= n; i++) rak[sa[i]] = i;
    for (i = 0; i < n; height[rak[i++]] = k)
        for (k ? k-- : 0, j = sa[rak[i] - 1]; r[i + k] == r[j + k]; k++);
    for(int i=n;i;i--) rak[i]=rak[i-1];
    for(int i=n;i;i--) sa[i]++;
}
void rmq()
{
	for(int j=0;j<=17;j++)
	{
		for(int i=1;i+(1<<j)-1<=n;i++)
		{
			if(j==0)
			{
				f[i][j]=height[i];
			}
			else
			{
				f[i][j]=min(f[i][j-1],f[i+(1<<(j-1))][j-1]);
			}
		}
	}
}
int query(int a,int b)
{
	if(a>b) return query(b,a);
	a++;
	int len=b-a+1;
	int t=log((double)len)/log(2.0); 
	return min(f[a][t],f[b-(1<<t)+1][t]);
}
int q[N];
int main() {
	int cas=0;
    while (scanf("%s", s+1)&&s[1] != '#') {
        n = strlen(s+1);
        for (int i = 1; i <= n; i++)
            cal[i] = s[i] - 'a' + 1;
        cal[n+1] = 0;
        dc3(cal+1, sa, n + 1, 30);
        calheight(cal+1, sa, n);
        rmq();
        int maxx=0;
        int num=0;
        for(int i=1;i<=n;i++)
        {
        	for(int j=0;i*(j+1)+1<=n;j++)
        	{
        		int k=query(rak[i*j+1],rak[i*(j+1)+1]);
        		int temp=k/i+1;
        		if(i*j+1-(i-k%i)>0&&query(rak[i*j+1-(i-k%i)],rak[i*(j+1)+1-(i-k%i)])>=(i-k%i))
				{
					temp++;
				 } 
        	    k=temp;
        		if(k==maxx&&i!=q[num-1])
        		{
        			q[num++]=i;
				}
        		else if(k>maxx)
        		{
        			maxx=k;num=0,q[num++]=i;
				}
				
			}
		}
		int flag=0;
		for(int i=1;i<=n;i++)
		{
			for(int j=0;j<num;j++)
			{
				if(query(rak[sa[i]],rak[sa[i]+q[j]])>=q[j]*(maxx-1))
				{
					s[sa[i]+q[j]*maxx]='\0';
					printf("Case %d: %s\n",++cas,s+sa[i]);
					flag=1;
					break;
				}
			}
			if(flag) break;
		}
    }
    return 0;
}