后缀自动机
摘要:后缀自动机的疑难点 代码 void sam_extend(char c) { int cur = sz++; st[cur].len = st[last].len + 1; int p = last; while (p != -1 && !st[p].next.count(c)) { st[p].n
阅读全文
posted @ 2023-01-30 21:12
posted @ 2023-01-30 21:12
Powered by:
博客园
Copyright © 2025 star_road_xyz
Powered by .NET 9.0 on Kubernetes