AC自动机(HDU2222 HDU3065)

//HDU2222
#include <bits/stdc++.h>

using namespace std;
const int MAXN = 500000 + 5;
const int SIGMA = CHAR_MAX;
int f[MAXN], last[MAXN];

struct trie {
    int ch[MAXN][SIGMA];
    int val[MAXN];
    int sz;

    void init() {
        for (int i = 0; i < sz; i++)
            last[i] = f[i] = 0;
        sz = 0;
        memset(ch[0], 0, sizeof(ch[0]));
    }

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

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

    int query(char *s) {
        int u = 0;
        int len = strlen(s);
        for (int i = 0; i < len; i++) {
            int c = idx(s[i]);
            if (ch[u][c])u = ch[u][c];
        }
        return val[u];
    }
} tr;

void print(int j) { if (j)printf("%d/n", j); }

void getfail(int *f) {
    queue<int> q;
    f[0] = 0;
    for (int c = 0; c < SIGMA; c++) {
        int u = tr.ch[0][c];
        if (u) {
            f[u] = 0;
            q.push(u);
            last[u] = 0;
        }
    }
    while (!q.empty()) {
        int r = q.front();
        q.pop();
        for (int c = 0; c < SIGMA; c++) {
            int u = tr.ch[r][c];
            if (!u)continue;
            q.push(u);
            int v = f[r];
            while (v && !tr.ch[v][c])v = f[v];
            f[u] = tr.ch[u][c];
            if (tr.val[f[u]])last[u] = f[u];
            else last[u] = last[f[u]];
        }
    }
}

void find(char *s) {
    int len = strlen(s);
    int j = 0;
    getfail(f);
    for (int i = 0; i < len; i++) {
        int c = tr.idx(s[i]);
        while (j && !tr.ch[j][c])j = f[j];
        j = tr.ch[j][c];
        if (tr.val[j])print(j);
        else if (last[j])print(last[j]);
    }
}

int main() {
    int T, n;
    char a[MAXN], b[MAXN];
    scanf("%d", &T);
    while (T--) {
        tr.init();
        scanf("%d", &n);
        while (n--) {
            scanf("%s", a);
            tr.insert(a, 1);
        }
        scanf("%s", b);
        find(b);
    }
    return 0;
}

//HDU3065
#include <bits/stdc++.h>

using namespace std;

const int SIGMA_SIZE = 26;
const int MAXNODE = 50000 + 5;
const int MAXN = 1000 + 5;

struct AhoCorasickAutomata {
    int ch[MAXNODE][SIGMA_SIZE];
    int f[MAXNODE];    // fail函数
    int id[MAXNODE];  // 每个字符串的结尾结点都有一个非0的id
    int last[MAXNODE]; // 输出链表的下一个结点
    int cnt[MAXN];
    int sz;

    void init() {
        sz = 1;
        memset(ch[0], 0, sizeof(ch[0]));
        memset(cnt, 0, sizeof(cnt));
        memset(id, 0, sizeof(id));
        memset(f, 0, sizeof(f));
        memset(last, 0, sizeof(last));
    }

    // 字符c的编号
    int idx(char c) {
        return c - 'A';
    }

    // 插入字符串。v必须非0
    void insert(char *s, int v) {
        int u = 0, n = strlen(s);
        for (int i = 0; i < n; i++) {
            int c = idx(s[i]);
            if (!ch[u][c]) {
                memset(ch[sz], 0, sizeof(ch[sz]));
                id[sz] = 0;
                ch[u][c] = sz++;
            }
            u = ch[u][c];
        }
        id[u] = v;
    }

    // 递归打印以结点j结尾的所有字符串
    void print(int j) {
        if (j) {
            cnt[id[j]]++;
            print(last[j]);
        }
    }

    // 在T中找模板
    int find(char *T) {
        int n = strlen(T);
        int j = 0; // 当前结点编号，初始为根结点
        for (int i = 0; i < n; i++) { // 文本串当前指针
            int c = idx(T[i]);
            if (!isupper(T[i])) {
                j = 0;
                continue;
            }
            while (j && !ch[j][c]) j = f[j]; // 顺着失边走，直到可以匹配
            j = ch[j][c];
            if (id[j]) print(j);
            else if (last[j]) print(last[j]); // 找到了！
        }
    }

    // 计算fail函数
    void getFail() {
        queue<int> q;
        f[0] = 0;
        // 初始化队列
        for (int c = 0; c < SIGMA_SIZE; c++) {
            int u = ch[0][c];
            if (u) {
                f[u] = 0;
                q.push(u);
                last[u] = 0;
            }
        }
        // 按BFS顺序计算fail
        while (!q.empty()) {
            int r = q.front();
            q.pop();
            for (int c = 0; c < SIGMA_SIZE; c++) {
                int u = ch[r][c];
                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] = id[f[u]] ? f[u] : last[f[u]];
            }
        }
    }

};

AhoCorasickAutomata ac;
char text[2000000 + 5], P[MAXN][50 + 5];

int main() {
    int n;
    while (scanf("%d", &n) == 1) {
        ac.init();
        for (int i = 1; i <= n; i++) {
            scanf("%s", P[i]);
            ac.insert(P[i], i);
        }
        ac.getFail();
        scanf("%s", text);
        ac.find(text);
        for (int i = 1; i <= n; i++) {
            if (ac.cnt[i]) {
                printf("%s: %d\n", P[i], ac.cnt[i]);
            }
        }
    }
    return 0;
}