1 Queue Sort

发布时间 2024-01-09 20:08:46作者: yufan1102

image
image
image

当时直接秒了

#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
int a[N];
void solve(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	int mi=1e9+10;
	int j;
	for(int i=1;i<=n;i++){
		if(mi>a[i]){
			mi=a[i];
			j=i;
		}
	}
	vector<int>k;
	for(int i=j;i<=n;i++){
		k.push_back(a[i]);
	}
    if(!is_sorted(k.begin(),k.end())){
    	cout<<-1<<"\n";
    	return;
	}
	cout<<j-1<<"\n";
}
int main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int t=1;
	cin>>t;
	for(int i=1;i<=t;i++)solve();
	return 0;
}