第四个点TLE求助

#include<bits/stdc++.h>
using namespace std;

char a[11000000+5],t[2*11000000+5];
int p[2*11000000+5];

int manacher(void){
//	memset(t,0,sizeof(t));
	t[0]='$';
	int len=0;
	char tmp;
	while((tmp=getchar())!='\n'&&tmp!=EOF){
		t[++len]='#';
		t[++len]=tmp;
	}
	t[++len]='#';
	int lst=len;
	int r=0,m=0;
	int maxb=0;
	for(int i=0;i<=lst;++i){
		int dc=2*m-i;
		if(r-i>dc){
			p[i]=min(p[dc],r-i);
		}
		else{
			p[i]=1;
		}
		while(t[i+p[i]]==t[i-p[i]]){
			++p[i];
		}
		if(i+p[i]>r){
			m=i;
			r=i+p[i];
		}
		if(p[i]>maxb){
			maxb=p[i];
		}
	}
	return maxb-1;
}

int main(){
	printf("%d\n",manacher());
	return 0;
}