Submission #72951948

---

Source Code Expand

#include<bits/stdc++.h>
#define int long long
using namespace std;
int a[300000];
int n;
int m=1;
void dfs(int k,int x){
	if(k==1)return;
	int minn=2e9,minx=0;
	for(int i=x;i<=x+k-1;i++){
		if(a[i]<minn)minn=a[i],minx=i;
	}
	if(minx>x+k/2-1){
		for(int i=x,j=x+k-1;i<=j;i++,j--){
			swap(a[i],a[j]);
		}
	}
	dfs(k/2,x);
	dfs(k/2,x+k/2);
}
signed main(){
	int t;
	cin>>t;
	while(t--){
		cin>>n;
		m=1<<n;
		for(int i=1;i<=m;i++){
			cin>>a[i];
		}
		dfs(m,1);
		for(int i=1;i<=m;i++){
			cout<<a[i]<<" ";
		}
		cout<<"\n";
	}
	return 0;
}

Submission Info

Judge Result