AC自动机 复习笔记

疑问

Q：在 getfail 中怎么保证 bfs 不乱序的

代码

struct ACAM {
	#define Pt ACAM_N
	int size = 0;
	int son[Pt][26];
	int fail[Pt];
	int insert(char *s) {
		int sL = strlen(s + 1);
		int u = 0;
		rep (i, 1, sL) {
			int c = s[i] - 'a';
			if (!son[u][c]) son[u][c] = ++size;
			u = son[u][c];
		}
		return u;
	}
	void getfail() {
		queue <int> q;
		rep (c, 0, 25) {
			if (son[0][c]) {
				q.push(son[0][c]);
			}
		}
		while (!q.empty()) {
			int u = q.front(); q.pop();
			rep (c, 0, 25) {
				if (son[u][c]) {
					fail[son[u][c]] = son[fail[u]][c];
					q.push(son[u][c]);
				}
				else {
					son[u][c] = son[fail[u]][c];
				}
			}
		}
	}
} acam;