LA - 4670 - Dominating Patterns（AC自动机）

题意：给出N个由小写字母组成的字符串pattern，再给出一个字符串file，问哪个pattern在file中出现的次数最多，输出最多的次数及按输入顺序输出出现次数最多的pattern（1 <= N <= 150, 1 <= patterm的长度 <= 70, file的长度 <= 10^6）。

题目链接：https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=29&problem=2671

——>>AC自动机第一题。。。、

指针写法要注意判空！

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>

using namespace std;

const int maxn = 1000000 + 10;
const int maxm = 150 + 10;
const int maxw = 70 + 10;
char pa[maxm][maxw], qus[maxn];
int N, num[maxm];

void init(){
    memset(num, 0, sizeof(num));
}

struct node{
    int id;
    int cnt;
    node *next[26];
    node *fail;
    node(){
        id = -1;
        cnt = 0;
        memset(next, 0, sizeof(next));
        fail = NULL;
    }
};

struct AC{
    node *root;

    AC(){
        root = new node;
    }

    int idx(char c){
        return c - 'a';
    }

    void insert(char *s, int id){
        node *p = root;
        int len = strlen(s), i;
        for(i = 0; i < len; i++){
            int c = idx(s[i]);
            if(!p->next[c]) p->next[c] = new node;
            p = p->next[c];
        }
        p->id = id;
        p->cnt++;
    }

    void getFail(){
        root->fail = NULL;
        queue<node*> qu;
        qu.push(root);
        while(!qu.empty()){
            node *r = qu.front(); qu.pop();
            for(int c = 0; c < 26; c++) if(r->next[c]){
                node *u = r->next[c];
                qu.push(u);
                node *v = r->fail;
                while(v && !v->next[c]) v = v->fail;
                if(v) u->fail = v->next[c];
                else u->fail = root;
            }
        }
    }

    void find(char *T){
        getFail();
        int len = strlen(T), i;
        node *j = root;
        for(i = 0; i < len; i++){
            int c = idx(T[i]);
            while(j && !j->next[c]) j = j->fail;
            if(j) j = j->next[c];
            else j = root;
            node *p = j;
            while(p != root && p->cnt){
                num[p->id]++;
                p = p->fail;
            }
        }
    }

    void solve(){
        int Max = -1, i;
        for(i = 0; i < N; i++) Max = max(Max, num[i]);
        printf("%d\n", Max);
        for(i = 0; i < N; i++) if(num[i] == Max) puts(pa[i]);
    }
};

int main()
{
    while(scanf("%d", &N) == 1 && N){
        init();
        AC ac;
        for(int i = 0; i < N; i++){
            scanf("%s", pa[i]);
            ac.insert(pa[i], i);
        }
        scanf("%s", qus);
        ac.find(qus);
        ac.solve();
    }
    return 0;
}