~QWQ~
by bobi111 @ 2024-09-06 16:12:48
@[bobi111](/user/995711)
```cpp
#include <bits/stdc++.h>
using namespace std;
int n,a[65540][20];
int main(){
cin>>n;
for(int i=1;i<=pow(2,n);i++)cin>>a[i][0];
for(int i=0;i<n;i++){
int t=pow(2,i);
for(int j=1;j<=pow(2,n);j+=t*2)
a[j][i+1]=max(a[j][i],a[j+t][i]);
}
for(int i=0;i<=n;i++){
int t=pow(2,i);
//for(int j=1;j<=pow(2,n);j+=t)cout<<a[j][i]<<' ';
//cout<<'\n';
}
int q=pow(2,n)/2+1;
int w=min(a[1][n-1],a[q][n-1]);
for(int i=1;i<q*2;i++){//这里错了
if(a[i][0]==w){
cout<<i;
break;
}
}
return 0;
}
```
by Yxy7952 @ 2024-09-06 16:19:15
@[bobi111](/user/995711)
求关
by Yxy7952 @ 2024-09-06 16:19:34
@[Yxy7952](/user/936717) OK啊
by bobi111 @ 2024-09-06 16:22:17