bzoj 2882 工艺( SAM最小表示法字符集无限 )

题意：无限字符集的最小表示法

思路：用map 来存

#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
using namespace std;
const int maxn = 600005;
int pos[maxn<<1];
struct SAM{
    int fa[maxn<<1],    // 后缀链接
            //ch[maxn<<1][ch_size],
            len[maxn<<1],   //该节点最长串的长度
            tot,    // 节点总数
            last;  // 代表当前的整个串
            map<int,int> ma[maxn<<1];
    void init(){
        tot = last = 0;
        fa[0] = -1;
        len[0] = 0;
        ma[0].clear();
    }
    void extend( int x ){
        int p = last;
        int cur = ++tot;
        ma[cur].clear();
        len[cur] = len[last]+1;
        while( p != -1 && ma[p].find(x)==ma[p].end() ){
            ma[p][x] = cur;
            p  = fa[p];
        }
        if( p == -1 ){
            fa[cur] = 0;
        }else {
            int q = ma[p][x];
            if (len[q] == len[p] + 1) {
                fa[cur] = q;
            } else {
                int clone = ++tot;
                len[clone] = len[p] + 1;
                ma[clone] = ma[q];
                fa[clone] = fa[q];
                fa[q] = fa[cur] = clone;
                while (p != -1) {
                    if (ma[p][x] == q)ma[p][x] = clone;
                    else break;
                    p = fa[p];
                }
            }
        }
        last = cur;
    }
}g;
int b[maxn<<1],c[maxn];
void radix( int len ){
    memset( c,0,sizeof(c) );
    for( int i = 1;i <= g.tot;i++ ) c[ g.len[i] ]++;
    for( int i = 2;i <= len;i++ ) c[ i ] += c[i-1];
    for( int i = 1;i <= g.tot;i++ ) b[  c[ g.len[i] ]-- ] = i;
}
int a[maxn];
int main(){
    int n;
    scanf("%d",&n);
        g.init();
        for (int i = 1; i <= n; i++) {
            scanf("%d",&a[i]);
            g.extend( a[i] );
        }
        for( int i = 1;i <= n;i++ ) {
            g.extend(a[i]);
        }
        radix(n<<1);
        int  p = 0;
        for( int i = 1;i <= n;i++ ) {
            int c = a[i];
            p = g.ma[p][c];
            pos[p] = i;
        }
        for( int i = 1;i <= n;i++ ){
            int c = a[i];
            p = g.ma[p][c];
            pos[p] = i+n;
        }
        for( int i = g.tot;i >= 1;i-- ){
            int j = b[i];
            pos[ g.fa[j] ] = pos[ g.fa[j] ] ? min( pos[ g.fa[j] ],pos[j] ):pos[j];
        }
        p = 0;
        for( int i = 1;i <= n;i++ ){
            p = g.ma[p].begin()->second;
        }
        int ans = pos[p] - n+1;
        for( int i = 1;i <= n;i++ ) {
            printf("%d ", a[ans]);
            ans = ans % n + 1;
        }
    return 0;
}