求最长回文串长度板子

#include<cstdio>
#include<cstring>
using namespace std;
int a[10000010];
int mannchar(int *p,int n)
{
int s,e,i,max=0;
s=0;
while(s<=n)
{
i=e=s;
while(p[s]==p[e])e++;
s=e;
e--;
while(p[i]>=p[i-1]&&p[i-1]==p[e+1]) i--,e++;
int t=e-i+1;
if(max<t) max=t;
}
return max;
}
int main()
{
a[0]=9999;//*如果是字符串就 a[0] = '$'
int n,i,t;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=1;i<=n;i++) scanf("%d",&a[i]);
printf("%d\n",mannchar(a,n));
}
}