#include <bits/stdc++.h>
using namespace std;
#define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int long long
#define rep(i,a,b) for(int i=a;i<b;++i)
#define yes cout << "YES\n"
#define no cout << "NO\n"
void solve() {
int n; cin >> n;
int* a = new int[n];
rep(i, 0, n) cin >> a[i];
int i = 0;
while (i + 1 < n && a[i] <= a[i + 1]) ++i;
// allow all-equal case
bool all_equal = true;
rep(j, 1, n) {
if (a[j] != a[0]) {
all_equal = false;
break;
}
}
if (!all_equal && (i == 0 || i == n - 1)) {
no;
delete[] a;
return;
}
while (i + 1 < n && a[i] >= a[i + 1]) ++i;
if (i == n - 1) yes;
else no;
delete[] a;
}
int32_t main() {
fast_io;
int t; cin >> t;
while (t--) solve();
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgojZGVmaW5lIGZhc3RfaW8gaW9zOjpzeW5jX3dpdGhfc3RkaW8oMCk7IGNpbi50aWUoMCk7IGNvdXQudGllKDApCiNkZWZpbmUgaW50IGxvbmcgbG9uZwojZGVmaW5lIHJlcChpLGEsYikgZm9yKGludCBpPWE7aTxiOysraSkKI2RlZmluZSB5ZXMgY291dCA8PCAiWUVTXG4iCiNkZWZpbmUgbm8gY291dCA8PCAiTk9cbiIKCnZvaWQgc29sdmUoKSB7CiAgICBpbnQgbjsgY2luID4+IG47CiAgICBpbnQqIGEgPSBuZXcgaW50W25dOwogICAgcmVwKGksIDAsIG4pIGNpbiA+PiBhW2ldOwoKICAgIGludCBpID0gMDsKICAgIHdoaWxlIChpICsgMSA8IG4gJiYgYVtpXSA8PSBhW2kgKyAxXSkgKytpOwoKICAgIC8vIGFsbG93IGFsbC1lcXVhbCBjYXNlCiAgICBib29sIGFsbF9lcXVhbCA9IHRydWU7CiAgICByZXAoaiwgMSwgbikgewogICAgICAgIGlmIChhW2pdICE9IGFbMF0pIHsKICAgICAgICAgICAgYWxsX2VxdWFsID0gZmFsc2U7CiAgICAgICAgICAgIGJyZWFrOwogICAgICAgIH0KICAgIH0KCiAgICBpZiAoIWFsbF9lcXVhbCAmJiAoaSA9PSAwIHx8IGkgPT0gbiAtIDEpKSB7CiAgICAgICAgbm87CiAgICAgICAgZGVsZXRlW10gYTsKICAgICAgICByZXR1cm47CiAgICB9CgogICAgd2hpbGUgKGkgKyAxIDwgbiAmJiBhW2ldID49IGFbaSArIDFdKSArK2k7CgogICAgaWYgKGkgPT0gbiAtIDEpIHllczsKICAgIGVsc2Ugbm87CgogICAgZGVsZXRlW10gYTsKfQoKaW50MzJfdCBtYWluKCkgewogICAgZmFzdF9pbzsKICAgIGludCB0OyBjaW4gPj4gdDsKICAgIHdoaWxlICh0LS0pIHNvbHZlKCk7CiAgICByZXR1cm4gMDsKfQo=