for tc in range(int(input())):
n = int(input())
c = list(map(int, input().split(' ')))
if c.count(1) != 1:
print('NO')
continue
flg = True
for i in range(n):
if c[i] - c[i-1] > 1:
flg = False
break
print('YES' if flg else 'NO')
/**
* ^~^ ,
* ('Y') )
* / \/
* (\|||/)
**/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <numeric>
#include <map>
#include <unordered_map>
#include <string>
#include <cmath>
#include <tuple>
#include <queue>
#include <stack>
#include <cassert>
#include <random>
#include <array>
using namespace std;
#define ll long long
#define log(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<class T, class ...Vals>
void logger(T names, Vals&&... values){
cout << names << " = ";
string delimiter = "";
(..., (cout << delimiter << values, delimiter = ", "));
cout << '\n';
}
const int INF = 0x7FFFFFFF;
const int MINF = 0x80000000;
const int MOD = 1e9+7;
// const int MOD = 998244353;
// ios_base::sync_with_stdio(0);
// cin.tie(0);
template<class T, class U> void logv(vector<pair<T,U>> x){
for (int i = 0; i < x.size(); i++){
cout << x[i].first << " " << x[i].second << '\n';
}
}
template<class T> void logv(vector<T> x){
for (int i = 0; i < x.size(); i++){
cout << x[i] << " ";
}
cout << '\n';
}
void solve(){
int n; cin >> n;
vector<int> a(n);
for (auto &A : a) cin >> A;
int ones=0, ens=0;
for(int i = 0; i < n; i++){
ones += a[i]==1;
ens += a[i]==n;
}
if (ones!=1){
cout << "NO\n";
return;
}
if (ens>1){
cout << "NO\n";
return;
}
for (int i = 0; i < n; i++){
if(a[i]-a[(i-1+n)%n]>1){
cout << "NO\n";
return;
}
}
cout << "YES\n";
}
int main(){
int t; cin >> t;
while(t--){
solve();
}
}
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | 501A - Contest |
160A- Twins | 752. Open the Lock |
1535A - Fair Playoff | 1538F - Interesting Function |
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |