1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
| #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
#define REP(i,e,s) for(register int i=e; i<=s; i++)
#define DREP(i,e,s) for(register int i=e; i>=s; i--)
#define DE(...) fprintf(stderr,__VA_ARGS__);
#define DEBUG(a) DE("DEBUG: %d\n",a)
#define file(a) freopen(a".in","r",stdin);freopen(a".out","w",stdout)
#define ll long long
int read() {
int x=0,f=1,ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
const int INF=0x3f3f3f,MAXN=200+10;
int p[MAXN];
int main() {
int t=read();
while(t--) {
int n=read();
REP(i,1,n) p[i]=read();
bool flag1=0,flag2=0;
int pos;
REP(i,1,n) if(p[i]==1) pos=i;
int cnt=1;
REP(i,1,n-1) {
int now=(i+pos)%n;
if(now==0) now=n;
cnt++;
if(p[now]!=cnt) flag1=1;
}
cnt=n+1;
REP(i,1,n-1) {
int now=(pos+i+n)%n;
if(now==0) now=n;
cnt--;
if(p[now]!=cnt) flag2=1;
}
if(!flag1||!flag2) puts("YES");
else puts("NO");
}
return 0;
}
|
