A-B-C 排序(思维)

A-B-C 排序 - CodeForces 1674D - 虚拟裁判 (csgrandeur.cn)

参考题解:(20条消息) Codeforces Round #786 (Div. 3)_qianhaodong的博客-CSDN博客 

code

#include<bits/stdc++.h>
#define x first
#define y second
#define mak make_pair
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define debug(a) cout<<a<<'\n'
#define endl '\n'
#define umap unordered_map
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
const int N=2e5+10,M=1,inf=0x3f3f3f3f,mod=1e9+7;
int t,n;
int a[N];

void solve()
{
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i];
	
	if(n%2==0)
	{
		for(int i=1;i<=n;i+=2)
		{
			if(a[i]>a[i+1]) swap(a[i],a[i+1]); 
		}
	}
	else
	{
		for(int i=2;i<=n;i+=2)
		{
			if(a[i]>a[i+1]) swap(a[i],a[i+1]);
		} 
	}
	
	if(is_sorted(a+1,a+n+1))
	{
		cout<<"YES"<<endl;
	}
	else cout<<"NO"<<endl;
	
	
}


int main()
{
	IOS;
	cin>>t;
	
	while(t--)
	{
		solve();
	}
	
	return 0;
}