spoj Lexicographical Substring Search

 题意：求本质不同的子串中字典序第k小的

思路：后缀自动机的每个节点向后走 能走出多少个本质不同的子串，可以通过dp求出。

#include <bits/stdc++.h>
using namespace std;
const int maxn = 90005;
int righ[2*maxn],cnt[maxn<<1];
const int ch_size = 26;
struct SAM{
    int fa[maxn*2],    // 后缀链接
            ch[maxn*2][ch_size],
            len[maxn*2],   //该节点最长串的长度
            tot,    // 节点总数
            last;  // 代表当前的整个串
    void init(){
        tot = last = 0;
        fa[0] = -1;
        len[0] = 0;
        memset( ch[0],0,sizeof( ch[0] ) );
    }
    void extend( int x ){
        int p = last;
        int cur = ++tot;
        memset( ch[cur],0,sizeof( ch[cur] ) );
        len[cur] = len[last]+1;
        while( p != -1 && !ch[p][x] ){
            ch[p][x] = cur;
            p  = fa[p];
        }
        if( p == -1 ){
            fa[cur] = 0;
        }else {
            int q = ch[p][x];
            if (len[q] == len[p] + 1) {
                fa[cur] = q;
            } else {
                int clone = ++tot;
                len[clone] = len[p] + 1;
                for (int i = 0; i < ch_size; i++) {
                    ch[clone][i] = ch[q][i];
                }
                fa[clone] = fa[q];
                fa[q] = fa[cur] = clone;
                while (p != -1) {
                    if (ch[p][x] == q)ch[p][x] = clone;
                    else break;
                    p = fa[p];
                }
            }
        }
        last = cur;
    }
}g;
char str[maxn];
int c[maxn],b[maxn<<1];
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 main(){
    scanf("%s",str);
    g.init();
    int len = strlen(str);
    for( int i = 0;i < len;i++ ){
        g.extend( str[i]-'a' );
    }
    radix(len);
    int p = 0;
    for( int i = 0;i < len;i++ ){
        p = g.ch[p][ str[i]-'a' ];
        righ[p] = 1;
    }
    for( int i = g.tot;i >= 1;i-- ){
        int j = b[i];
        cnt[j] = 1;
        for( int c = 0;c < 26;c++ ){
            if( g.ch[j][c] )
            cnt[j] += cnt[g.ch[j][c]];
        }
    }
    int k,q;
    scanf("%d",&q);
    while( q-- ){
        scanf("%d",&k);
        int p = 0;
        while(1) {
            if(p)k --;
            for (int c = 0; c < 26; c++) {
                if (k <= 0) break;
                int y = g.ch[p][c];
                if (!y) continue;
                if (cnt[y] < k) {
                    k -= cnt[y];
                } else {
                    putchar('a' + c);
                    p = g.ch[p][c];
                    break;
                }
                if (k <= 0) break;
            }
            if(k <= 0) break;
        }
        printf("\n");
    }
    return 0;
};