P4715 蒟蒻求助，60分代码```
#include <bits/stdc++.h>
using namespace std;
int n,num[130],lmax = 0,rmax = 0;
int main()
{
cin >> n;
n = pow(2,n);
for (int i = 1;i <= n;i++)
{
cin >> num[i];
}
for (int i = 1;i <= n / 2;i++)
{
if (num[i] > num[lmax])
{
lmax = i;
}
}
for (int i = n / 2 + 1;i <= n;i++)
{
if (num[i] > num[rmax])
{
rmax = i;
}
}
cout << min(lmax,rmax);
return 0;
}
玄关
