BUPT OJ 中序遍歷序列

水

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
      int t,n,x;
	  cin>>t;
      
	while(t--)
	{
		vector<int>BeforeSort;
		vector<int>AfterSort;
		cin>>n;
		while(n--)
		{	cin>>x;
			BeforeSort.push_back(x);
			
			
		}
		AfterSort=BeforeSort;
		sort(AfterSort.begin(),AfterSort.end());
		if(AfterSort==BeforeSort){
			
			cout<<"Yes\n";
		}
		else cout<<"No\n";
	}

 
}