#include<stdio.h>

#include<string.h>

#include<algorithm>

#include<iostream>

#include<vector>

#include<queue>

#include<set>

using namespace std;

#define met(a, b) memset(a, b, sizeof(a))

#define N 100005

#define INF 0x3f3f3f3f

typedef long long LL;

int n, a[N], dp[N];

int solve1()

{

    for(int i=; i<=n; i++)

        dp[i] = INF;

    int ans = ;

    for(int i=; i<=n; i++)

    {

        int pos = upper_bound(dp, dp+n, a[i]) - dp;

        dp[pos] = min(dp[pos], a[i]);

        ans = max(ans, pos);

    }

    return ans+;

}

int solve2()

{

    for(int i=; i<=n; i++)

        dp[i] = INF;

    int ans = ;

    for(int i=n; i>=; i--)

    {

        int pos = upper_bound(dp, dp+n, a[i]) - dp;

        dp[pos] = min(dp[pos], a[i]);

        ans = max(ans, pos);

    }

    return ans+;

}

int main()

{

    int T;

    scanf("%d", &T);

    while(T--)

    {

        scanf("%d", &n);

        for(int i=; i<=n; i++)

            scanf("%d", &a[i]);

        int ans1 = solve1();

        int ans2 = solve2();

        if(ans1 >= n- || ans2 >= n-)

            puts("YES");

        else

            puts("NO");

    }

    return ;

}