from sys import stdin
import math
t = int(stdin.readline().rstrip())
for _ in range(t):
stdin.readline()
nums = list(map(int, stdin.readline().rstrip().split(' ')))
l = 0
r = 1
ans = True
while r < len(nums):
found = False
while r < len(nums):
if (nums[l] < nums[r]):
found = True
r += 1
break
r += 1
if not found:
ans = False
break
print('YES' if ans else 'NO')#include <bits/stdc++.h>
using namespace std;
int main()
{
int tc;
cin>>tc;
string ans[]= {"NO","YES"};
while(tc--)
{
int n;
bool b=0;
cin>>n;
int x[n];
for(int i=0;i<n;i++)
cin>>x[i];
b=(x[n-1]>x[0]);
cout<<ans[b]<<endl;
}
return 0;
}
1473A - Replacing Elements | 959A - Mahmoud and Ehab and the even-odd game |
78B - Easter Eggs | 1455B - Jumps |
1225C - p-binary | 1525D - Armchairs |
1257A - Two Rival Students | 1415A - Prison Break |
1271A - Suits | 259B - Little Elephant and Magic Square |
1389A - LCM Problem | 778A - String Game |
1382A - Common Subsequence | 1512D - Corrupted Array |
667B - Coat of Anticubism | 284B - Cows and Poker Game |
1666D - Deletive Editing | 1433D - Districts Connection |
2B - The least round way | 1324A - Yet Another Tetris Problem |
246B - Increase and Decrease | 22E - Scheme |
1566A - Median Maximization | 1278A - Shuffle Hashing |
1666F - Fancy Stack | 1354A - Alarm Clock |
1543B - Customising the Track | 1337A - Ichihime and Triangle |
1366A - Shovels and Swords | 919A - Supermarket |