//4360643 2011-08-08 15:04:56 Accepted 3833 2671MS 224K 804 B C++ ylwh!
#include <stdio.h>
int main()
{
int t, n, i, j, k, ans, temp, s[10001];
scanf("%d", &t);
while(t--)
{
scanf("%d", &n);
for(i=1; i<=n; i++)
{
scanf("%d", &temp);
s[temp] = i;
}
ans = 0;
for(i=1; i<n; i+=2)
for(j= n%2?n:n-1; j>i; j -= 2)
{
k = (i+j)/2;
if( (s[k] > s[i] && s[k] < s[j]) ||
(s[k] < s[i] && s[k] > s[j]) )
{
ans = 1;
goto X;
}
}
for(i=2; i<n; i+=2)
for(j=n%2?n-1:n; j>i; j-=2)
{
k = (i+j)/2;
if( (s[k] > s[i] && s[k] < s[j]) ||
(s[k] < s[i] && s[k] > s[j]) )
{
ans = 1;
goto X;
}
}
X:
if(ans)
printf("Y\n");
else
printf("N\n");
}
return 0;
}
算法是百度的,长见识了,数据存的很有特色的有木有!~~T_T 顺便改了一下比原来的少了200ms = =!, 嘿嘿