poj3581_Sequence（后缀数组）

#include<cstdio>
#include<iostream>
#include<vector>
#include<string.h>
#include<algorithm>
using namespace std;

int sa[400010];
int grade[400010];
int seq[200010];
int tempg[400010];
int rev[400010];
int k;
int n;

bool cmpg(int a, int b)
{
    if (grade[a] != grade[b])
        return grade[a] < grade[b];
    else
    {
        int nexa = a + k <= n ? grade[a + k] : -1;
        int nexb = b + k <= n ? grade[b + k] : -1;
        return nexa < nexb;
    }
}

void getsa(int *v)
{
    for (int i = 0; i <= n; i++)
    {
        sa[i] = i;
        grade[i] = i < n ? v[i] : -1;
    }
    for (k = 1; k <= n; k *= 2)
    {
        sort(sa, sa + n + 1, cmpg);
        tempg[sa[0]] = 0;
        for (int i = 1; i <= n; i++)
        {
            tempg[sa[i]] = tempg[sa[i - 1]] + (cmpg(sa[i - 1], sa[i]) ? 1 : 0);
        }
        memcpy(grade, tempg, sizeof(int)*n);
    }
}

int main()
{
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &seq[i]);
    }
    reverse(seq, seq + n);
    getsa(seq);
    int s1;
    for (s1 = 1; s1 <= n; s1++)
    {
        if (sa[s1]>1)
            break;
    }
    for (int i = sa[s1]; i < n; i++)
    {
        printf("%d\n", seq[i]);
    }
    n = sa[s1] * 2;
    int len = n / 2;
    memcpy(rev, seq, sizeof(int)*len);
    memcpy(rev + len, seq, sizeof(int)*len);
    getsa(rev);
    int s2 = 1;
    for (s2 = 1; s2 <= n; s2++)
    {
        if (sa[s2]>0 && sa[s2] < len)
            break;
    }
    for (int i = sa[s2], j = 0; j < len; i++, j++)
    {
        printf("%d\n", rev[i]);
    }

    return 0;
}