![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
回文自动机
wtcl
这个作者很懒,什么都没留下…
展开
-
Codeforces Global Round 7 D2. Prefix-Suffix Palindrome (Hard version)(马拉车 回文自动机)
#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#include<queue>using namespace std;const int N=1e6+100;char ss[N];char s[N*2];char str[N];...原创 2020-03-27 23:43:02 · 100 阅读 · 0 评论 -
回文树(回文自动机)
讲解:https://blog.csdn.net/lwfcgz/article/details/48739051代码:https://www.cnblogs.com/DWVictor/p/11324247.htmlconst int MAXN = 100005 ; const int N = 26 ; struct Palindromic_Tree { //cnt最后co...原创 2020-03-28 00:32:39 · 104 阅读 · 0 评论