POJ 3581（后缀数组）

要是用白书的板子 不用离散
要是蓝书的板子的话，因为m不知道上下线，需要离散
对于找一个字典序，只需要是一个串的子串，而不需要完全是一个串的后缀，但也可以用SA做

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <cmath>
#define LL long long
#define eps 1e-8
const LL INF = 0x3f3f3f3f;
const int maxn = 200000 + 5;
using namespace std;
int n;
int a[maxn*2];
int sa[maxn*2];
int t[maxn*2];
int t2[maxn*2];
int c[maxn*2];
int s[maxn*2];
int back[maxn];
struct Node{
    int cost;
    int id;
}node[maxn];
bool cmp(Node p ,Node q){
    if(p.cost == q.cost)
        return p.id < q.id;
    return p.cost < q.cost;
}
void build_sa(int n, int m, int *s){
    int *x = t, *y = t2;
    for(int i=0; i<m; i++) c[i] = 0;
    for(int i=0; i<n; i++) c[x[i] = s[i]]++;
    for(int i=1; i<m; i++) c[i] += c[i-1];
    for(int i=n-1; i>=0; i--) sa[--c[x[i]]] = i;
    for(int k=1; k<=n; k<<=1){
        int p = 0;
        for(int i=n-k; i<n; i++) y[p++] = i;
        for(int i=0; i<n; i++) if(sa[i] >= k) y[p++] = sa[i] - k;
        for(int i=0; i<m; i++) c[i] = 0;
        for(int i=0; i<n; i++) c[x[y[i]]]++;
        for(int i=0; i<m; i++) c[i] += c[i-1];
        for(int i=n-1; i>=0; i--) sa[--c[x[y[i]]]] = y[i];
        swap(x,y);
        p = 1; x[sa[0]] = 0;
        for(int 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;
    }
}
int main(){
    scanf("%d",&n);
    for(int i=0; i<n; i++){
        scanf("%d",&node[i].cost);
        node[i].id = i;
    }
    sort(node,node+n,cmp);
    for(int i=0; i<n; i++){
        if(i && node[i].cost == node[i-1].cost){
            a[node[i].id] = a[node[i-1].id];
            continue;
        }
        a[node[i].id] = i;
        back[i] = node[i].cost;
    }
    reverse_copy(a,a+n,s);//字符串翻转并复制
    build_sa(n,maxn,s);
    int pos1 = 0;
    for(int i=0; i<n; i++){
        pos1 = n - sa[i];
        if(pos1 >= 1 && n - pos1 >= 2) break;
    }
    int m = n - pos1;
    reverse_copy(a+pos1, a+n, s);
    reverse_copy(a+pos1, a+n, s+m);
    build_sa(m*2,maxn,s);
    int pos2 = 0;
    for(int i=0; i<=2*m; i++){
        pos2 = pos1 + m - sa[i];
        if(pos2 - pos1 >= 1 && n - pos2 >= 1) break;
    }
    reverse(a, a+pos1);
    reverse(a+pos1,a+pos2);
    reverse(a+pos2,a+n);
    for(int i=0; i<n; i++){
        printf("%d\n",back[a[i]]);
    }
}