这题扩大半径的时候需要特判,晚上脑子乱,弄了好久。
//
// main.cpp
// Richard
//
// Created by 邵金杰 on 16/9/27.
// Copyright © 2016年 邵金杰. All rights reserved.
//
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=100000+100;
const int inf=99999999;
int s[maxn*2],p[maxn*2];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++) scanf("%d",&s[i]);
s[n]=inf+1;
for(int i=n;i>=0;i--){
s[i+i+2]=s[i];
s[i+i+1]=inf;
}
s[0]=inf-1;
int id=0,maxlen=0;
for(int i=2;i<n*2+1;i++)
{
if(p[id]+id>i) p[i]=min(p[2*id-i],p[id]+id-i);
else p[i]=1;
while(s[i+p[i]]==s[i-p[i]]) {
if(s[i-p[i]]==inf) p[i]++;
else{
if((i-p[i]+2<=i&&s[i-p[i]]<=s[i-p[i]+2])||i-p[i]+2>i) p[i]++;
else break;
}
}
if(i+p[i]>id+p[id]) id=i;
if(p[i]>maxlen) maxlen=p[i];
}
cout<<maxlen-1<<endl;
}
return 0;
}