WA#1#2
查看原帖
WA#1#2
713098
Koei楼主2024/5/3 14:22
#include<bits/stdc++.h> 
using namespace std;
int n,u=1;
struct node{
	int x,id;
}a[5010];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		u=u*2;
	}
	for(int i=0;i<u;i++){
		cin>>a[u+i].x;
		a[u+i].id=i+1;
	}
	for(int i=u-1;i>0;i--){
		int son=i*2;
		if(a[son].x>a[son+1].x){
			a[i].x=a[son].x;
			a[i].id=a[son].id;
		}else{
			a[i].x=a[son+1].x;
			a[i].id=a[son+1].id;
		}
	}//cout<<1<<"\n"; 
/*	for(int i=1;i<u;i++){
		cout<<a[i*2].x<<" "<<a[i*2+1].x<<"\n";
	}*/ 
	if(a[1].x<a[2].x){
		cout<<a[1].id<<"\n";
	}else{
		cout<<a[2].id<<"\n";
	}
	return 0;
}
2024/5/3 14:22
加载中...