P4715 【深基16.例1】淘汰赛 C++ AC代码

#include <bits/stdc++.h>

using namespace std;

const int N=1000100;
long long n,p[N];
int main(){
  scanf("%d",&n);
  int l=pow(2,n);
  for (int i = 1; i <= l; i++)
  {
   scanf("%d",&p[i]);
  }
  int temp =l;
  for (int i = 1; i <= l+(l-1); i+=2)
  {
   if(p[i+1] !=0 ) p[++temp]= p[i] > p[i+1] ? p[i] : p[i+1];
  }

  int r  = p[temp -1] < p[temp-2] ? p[temp-1] : p[temp-2];
  for (int i = 1; i <=l; i++)
  {
   if(r == p[i]){
     printf("%d",i);
     break;
   }
  }
  return 0;
}