本文共 841 字，大约阅读时间需要 2 分钟。
详见:
本人只是存一个代码
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;typedef long long LL;const int INF=2e9+1e8;const int MOD=1e9+7;const int MAXSIZE=1e6+5;const double eps=0.0000000001;void fre(){ freopen("in.txt","r",stdin); freopen("out.txt","w",stdout);}#define memst(a,b) memset(a,b,sizeof(a))#define fr(i,a,n) for(int i=a;i i) p[i]=min(p[2*id-i],mx-i); else p[i]=1; while(str[i+p[i]]==str[i-p[i]]) p[i]++; if(p[i]+i>mx) { mx=p[i]+i; id=i; } }}int main(int argc,char *argv[]){ while(scanf("%s",&s)!=EOF) { len=strlen(s); Manacher(); int ans=1; for(int i=1;i
转载于:https://www.cnblogs.com/coded-ream/p/7207951.html