这篇博客探讨了如何利用后缀自动机快速解决关于字符串中连续子串与给定字符串循环同构的查询问题。博主介绍了如何构建后缀自动机，并详细解释了如何在自动机上进行查询，同时避免重复计数的方法。
C. Cyclical Quest
time limit per test
3 seconds
memory limit per test
512 megabytes
input
standard input
output
standard output
Some days ago, WJMZBMR learned how to answer the query "how many times does a string x occur in a string s" quickly by preprocessing the string s. But now he wants to make it harder.
So he wants to ask "how many consecutive substrings of s are cyclical isomorphic to a given string x". You are given string s and n strings xi, for each string x
最低0.47元/天 解锁文章
8219
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
