我在改一改
by lsy18653707830 @ 2024-07-26 16:27:52
我不知道你的做法，给你看看我的做法，就是按照题目模拟
```cpp
#include<bits/stdc++.h>
using namespace std;
int n;
struct node{
int d,id;
}a[(1<<7)+5];
node ma(node a,node b){
if(a.d>b.d)return a;
return b;
}
node mi(node a,node b){
if(a.d>b.d)return b;
return a;
}
int main(){
scanf("%d",&n);
for(int i=1;i<=(1<<n);++i)
scanf("%d",&a[i].d),a[i].id=i;
while(n>1){
for(int i=2;i<=(1<<n);i+=2)
a[i>>1]=ma(a[i],a[i-1]);
n--;
}
printf("%d",mi(a[1],a[2]).id);
return 0;
}
```
by KnowWind @ 2024-08-13 00:42:52