马拉车
找回文串的算法
void Mana(int n){
Init(n);
int len=n*2+1;
int Ans=0,Ansp=0,p=0,pos=0;
for(int i=1;i<=len;i++){
if(i<pos)R[i]=min(R[p*2-i],pos-i+1);
else R[i]=1;
while(AA[i-R[i]]==AA[i+R[i]])R[i]++;
if(pos<i+R[i]-1)pos=i+R[i]-1,p=i;
if(Ans<R[i]-1)Ans=R[i]-1,Ansp=i;
}
printf("%d\n",Ans);
for(int i=Ansp-R[Ansp]+1;i<=Ansp+R[Ansp]-1;i++)
if(AA[i]!=-1)printf("%d\n",AA[i]);
return;
}