题面

Sol

\(sa\)的话就直接连在一起后缀排序就好了

\(sam\)就插入两次，贪心在上面走就好了

# include 
    
     # define RG register# define IL inline# define Fill(a, b) memset(a, b, sizeof(a))using namespace std;typedef long long ll; IL int Input(){    RG int x = 0, z = 1; RG char c = getchar();    for(; c < '0' || c > '9'; c = getchar()) z = c == '-' ? -1 : 1;    for(; c >= '0' && c <= '9'; c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);    return x * z;} const int maxn(3e5 + 5);map 
     
       trans[maxn << 2];int fa[maxn << 2], tot = 1, last = 1, len[maxn << 2], n, a[maxn];IL void Extend(RG int c){    RG int p = last, np = ++tot;    len[last = np] = len[p] + 1;    while(p && !trans[p][c]) trans[p][c] = np, p = fa[p];    if(!p) fa[np] = 1;    else{        RG int q = trans[p][c];        if(len[q] == len[p] + 1) fa[np] = q;        else{            RG int nq = ++tot;            fa[nq] = fa[q], len[nq] = len[p] + 1;            trans[nq] = trans[q];            fa[q] = fa[np] = nq;            while(p && trans[p][c] == q) trans[p][c] = nq, p = fa[p];        }    }}int main(RG int argc, RG char *argv[]){    n = Input();    for(RG int i = 1; i <= n; ++i) Extend(a[i] = Input());    for(RG int i = 1; i <= n; ++i) Extend(a[i]);    for(RG int i = 1, nw = 1; i <= n; ++i){        printf("%d ", trans[nw].begin() -> first);        nw = trans[nw].begin() -> second;    }    return 0;}