#include <bits/stdc++.h>
using namespace std;
int a[101];
int main(){
	int t;
	cin>>t;
	while(t--){
		int n,pd=2,x=0,b=0;
		cin>>n;
		for(int i=1;i<=n;i++){
			cin>>a[i];
		}
		for(int i=1;i<=n;i++){
			if(a[i]>a[i-1]&&pd==2)pd=0;
			if(a[i]<a[i-1]&&pd==2){
				cout<<"no"<<endl;b=1;
				break ;
			}			
			if(pd==0&&a[i]<a[i-1]&&x==0){
				x=1;pd=1;
			}
			if(pd==1&&a[i]>a[i-1]&&x==1){
				cout<<"no"<<endl;b=1;
				break;
			}
		}if(b!=1)cout<<"yes"<<endl;
	}
	return 0;
}

易得，判断是否单增、先单增再单减、单减仅此三种情况即可