by jngrkek11 @ 2024-07-01 21:33:49
@[jngrkek11](/user/1157267)
赞成
by CodeAnythingNow @ 2024-07-01 21:40:55
同意降红。我第一次做的时候都是用自带的sort函数排序前半边和后半边，然后比较左右两边的最大值，看谁小，直接AC
by Wade_W @ 2024-07-10 14:15:30
同意，这都能过
```cpp
#include<bits/stdc++.h>
using namespace std;
#define MAX 2147483647
#define MIN -2147483647
#define int long long
#define double long long
int k[114514];
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
n=pow(2,n);
int n_2=n/2;
int zhil=1,maxn=MIN;
for (int i=1;i<=n;i++) cin>>k[i];
for (int i=1;i<=n_2;i++)
{
if (k[i]>maxn)
{
maxn=k[i];
zhil=i;
}
}
int zhir=1,maxm=MIN;
for (int i=n_2+1;i<=n;i++)
{
if (k[i]>maxm)
{
maxm=k[i];
zhir=i;
}
}
cout<<(maxm>maxn?zhil:zhir);
return 0;
}
```
by xzy_AK_IOI @ 2024-07-10 19:47:12
同意
by zhangzhixuan1 @ 2024-07-10 21:51:03