洛谷P3796 【模板】AC自动机（加强版）

2
aba
bab
ababababac
6
beta
alpha
haha
delta
dede
tata
dedeltalphahahahototatalpha
0

4
aba
2
alpha
haha

// luogu-judger-enable-o2
// luogu-judger-enable-o2
// luogu-judger-enable-o2
// luogu-judger-enable-o2
#include<cstdio>
#include<cstring>
#include<queue>
#include<vector>
using namespace std;
const int MAXN = 1e6 + 10, B = 26;
int T; 
char s[201][75], a[MAXN];
int N; 
int fail[MAXN], ch[MAXN][27], val[MAXN], root = 0, tot = 0, sum[MAXN];
void insert(char *s, int I) {
    int N = strlen(s + 1);
    int now = root;
    for(int i = 1; i <= N; i++) {
        int x = s[i] - 'a';
        if(!ch[now][x]) ch[now][x] = ++tot;
        now = ch[now][x];
    }
    val[now] = I;
}
void GetFail() {
    queue<int> q;
    for(int i = 0; i < B; i++) if(ch[root][i]) q.push(ch[root][i]);
    while(!q.empty()) {
        int p = q.front(); q.pop();
        for(int i = 0; i < B; i++) 
            if(ch[p][i]) fail[ch[p][i]] = ch[fail[p]][i], q.push(ch[p][i]);
            else ch[p][i] = ch[fail[p]][i];
    }
}
int main() {
#ifdef WIN32
    freopen("a.in", "r", stdin);
#endif
    while(scanf("%d", &T) && T) {
        memset(fail, 0, sizeof(fail)); memset(ch, 0, sizeof(ch)); 
        memset(val, 0, sizeof(val)); memset(fail, 0, sizeof(fail));
        memset(sum, 0, sizeof(sum)); memset(s, 0, sizeof(s));
        for(int i = 1; i <= T; i++) scanf("%s", s[i] + 1), insert(s[i], i);
        GetFail();
        scanf("%s", a + 1);
        int N = strlen(a + 1), now = root;
        for(int i = 1; i <= N; i++) {
            now = ch[now][a[i] - 'a'];
            for(int t = now; t; t = fail[t]) if(val[t]) sum[val[t]]++;
        }
        int ans = 0;
        for(int i = 1; i <= T; i++) ans = max(ans, sum[i]);
        printf("%d\n", ans);
        for(int i = 1; i <= T; i++)
            if(sum[i] == ans)
                printf("%s\n", s[i] + 1);
    } 
    return 0;
}