马拉车
wtcl
这个作者很懒,什么都没留下…
展开
-
Making Huge Palindromes LightOJ - 1258(manacher)
讲解:https://blog.csdn.net/chenzhenyu123456/article/details/49403031#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;const int MAXN=1100100;int Ma[MAXN*2];int Mp[MAXN*2];void Manacher(原创 2020-05-14 17:07:55 · 114 阅读 · 0 评论 -
Girls' research HDU - 3294(manacher)
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;const int MAXN=1100100;int Ma[MAXN*2];int Mp[MAXN*2];void Manacher(char s[],int len){ int l=0; Ma[l++]='$'; Ma[l++]='#'; fo原创 2020-05-14 13:22:17 · 67 阅读 · 0 评论 -
吉哥系列故事——完美队形II HDU - 4513(manacher)
比普通的manacher多添加条件可以用-1 -2 -3去填充数组这样可以只比较原数组的大小(当数小于0时不用比较)#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;const int MAXN=1100100;int Ma[MAXN*2];int Mp[MAXN*2];void Manacher(int s[原创 2020-05-14 12:17:02 · 72 阅读 · 0 评论 -
回文串(manacher)
mancher 模板#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;const int MAXN=110010;char Ma[MAXN*2];int Mp[MAXN*2];void Manacher(char s[],int len){ int l=0; Ma[l++]='$'; Ma[l++原创 2020-05-14 10:01:24 · 103 阅读 · 0 评论 -
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 · 102 阅读 · 0 评论