puppywolf的博客

https://jzoj.net/senior/#main/show/4876 想法： 拓展KMP的next数组#include <cstring>#include <cmath>#include <cstdio>#include <cstdlib>#include <ctime>#include <iostream>#define maxn 1000010#define

void make(){ mx=1,a=2; while (s[1+mx]==s[mx] && mx<m) mx++; nex[1]=m,nex[2]=mx-1,a=2; fo(i,3,m){ if (nex[i-a+1]<mx-i+1) nex[i]=nex[i-a+1]; else{ j=max(0,mx-i+1); while (s[i...