by liysjianttso @ 2023-06-22 19:44:44
```cpp
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1<<7+10;
struct po{
int val,id;
}value[MAXN];
int winner[MAXN];
int n;
void dfs(int x)
{
if(x>=1<<n)
{
return;
}
else
{
dfs(2*x);
dfs(2*x+1);
if(value[2*x].val>value[2*x+1].val)
{
value[x].val=value[2*x].val;
value[x].id=value[2*x].id;
winner[x]=winner[2*x];
}
else
{
value[x].val=value[2*x+1].val;
value[x].id=value[2*x+1].id;
winner[x]=winner[2*x+1];
}
}
}
int main()
{
cin >> n;
for(int i=0;i<(1<<n);i++)
{
cin >> value[i+(1<<n)].val;
value[i+(1<<n)].id=i+1;
winner[i+(1<<n)]=i+1;
}
dfs(1);
cout << (value[2].val>value[3].val?value[3].id:value[2].id);
return 0;
}
```
深搜不香吗？
by zhanghx0219 @ 2023-06-22 19:58:08
@[zhanghx0219](/user/415637) 你发代码有意义吗
by Loser_Syx @ 2023-06-22 20:20:35