#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;
typedef  long long  ll;
typedef unsigned long long ull;
#define MM(a,b) memset(a,b,sizeof(a));
#define inf 0x7f7f7f7f
#define FOR(i,n) for(int i=1;i<=n;i++)
#define CT continue;
#define PF printf
#define SC scanf
const int mod=1000000007;
const int N=100000+10;
ull seed=13331;

int dp[N],ans[N],a[N];
int main()
{
    int cas;
    scanf("%d",&cas);
    while(cas--){
       int n;scanf("%d",&n);
       for(int i=1;i<=n;i++) scanf("%d",&a[i]);
       int len=1,flag1=0,flag2=0;
       ans[1]=a[1];
       for(int i=2;i<=n;i++)
       {
             if(a[i]>=ans[len]) {len++;ans[len]=a[i];}
             else{
                int pos=upper_bound(ans+1,ans+len,a[i])-ans;
                ans[pos]=a[i];
             }
       }
       if(len>=n-1) flag1=1;
       len=1;ans[1]=a[n];
       for(int i=n-1;i>=1;i--)
       {
             if(a[i]>=ans[len]) {len++;ans[len]=a[i];}
             else{
                int pos=upper_bound(ans+1,ans+len,a[i])-ans;
                ans[pos]=a[i];
             }
       }
       if(len>=n-1) flag2=1;
       if(flag1||flag2) printf("YES\n");
       else printf("NO\n");
    }
    return 0;
}

 if(a[i]>=ans[len]) {len++;ans[len]=a[i];}
             else{
                int pos=upper_bound(ans+1,ans+len,a[i])-ans;//非严格单调
                ans[pos]=a[i];
             }