UVALive-4670 AC自动机入门题 求出现次数最多的子串

/**
链接：http://vjudge.net/problem/UVALive-4670
详见lrj训练指南P216
*/
#include<bits/stdc++.h>
using namespace std;
#define P pair<int,int>
#define ms(x,y) memset(x,y,sizeof x)
#define LL long long
const int maxn = ;
const int mod = 1e9+;
const int maxnode = *;
const int sigma_size = ;
map<string,int> mp;
int cnt[];
struct AhoCorasickAutomata
{
    int ch[maxnode][sigma_size];
    int val[maxnode];
    int sz;
    int f[maxnode];
    int last[maxnode];
    void clear(){sz = ; memset(ch[],,sizeof ch[]); }
    int idx(char c){return c-'a'; }

    void insert(char *s,int v)
    {
        int u = , n = strlen(s);
        for(int i = ; i < n; i++){
            int c = idx(s[i]);
            if(!ch[u][c]){
                memset(ch[sz], , sizeof ch[sz]);
                val[sz] = ;
                ch[u][c] = sz++;
            }
            u = ch[u][c];
        }
        val[u] = v;
    }

    void find(char *T){
        int n = strlen(T);
        int j = ;
        for(int i = ; i < n; i++){
            int c = idx(T[i]);
            //while(j&&!ch[j][c]) j = f[j];
            j = ch[j][c];
            if(val[j]) print(j);
            else if(last[j]) print(last[j]);
        }
    }

    void print(int j)
    {
        if(j){
            cnt[val[j]]++;
            print(last[j]);
        }
    }

    void getFail(){
        queue<int> q;
        f[] = ;
        for(int c = ; c < sigma_size; c++){
            int u = ch[][c];
            if(u){f[u] = ; q.push(u); last[u] = ;}
        }

        while(!q.empty()){
            int r = q.front(); q.pop();
            for(int c = ; c < sigma_size; c++){
                int u = ch[r][c];
                if(!u){
                    ch[r][c] = ch[f[r]][c]; continue;
                }//if(!u) continue;
                q.push(u);
                int v = f[r];
                while(v&&!ch[v][c]) v = f[v];
                f[u] = ch[v][c];
                last[u] = val[f[u]] ? f[u] : last[f[u]];
            }
        }
    }

} ac ;
char a[][];
char s[];
int main()
{
    int n;
    while(scanf("%d",&n)==&&n)
    {
        ac.clear();
        mp.clear();
        memset(cnt, , sizeof cnt);
        for(int i = ; i <= n; i++){
            scanf("%s",a[i]);
            ac.insert(a[i],i);
            mp[string(a[i])] = i;
        }
        scanf("%s",s);
        ac.getFail();
        ac.find(s);
        int mas = ;
        for(int i = ; i <= n; i++){
            if(cnt[i]>mas){mas = cnt[i];}
        }
        printf("%d\n",mas);
        for(int i = ; i <= n; i++){
            if(cnt[mp[string(a[i])]]==mas){
                printf("%s\n",a[i]);
            }
        }
    }
    return ;
}