Submission #19327272

---

Source Code Expand

#include<bits/stdc++.h>

#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define fst first
#define snd second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define EPS (1e-9)
#define equals(a,b) (fabs((a)-(b))<EPS)

using namespace std;

bool LT(double a,double b) { return !equals(a,b) && a < b; }
bool LTE(double a,double b) { return equals(a,b) || a < b; }

const string YES = "";
const string NO  = "";

typedef long long ll;
typedef pair<int,int> ii;

int n;
vector<int> A;

int main() {
  cin >> n;
  A.clear();
  int v;
  rep(i,(1<<n)) {
    cin >> v;
    A.pb(v);
  }
  int p1=0,p2=(1<<n)-1;
  int m = (1<<n) / 2;
  rep(i,m) {
    if( A[p1] < A[i] ) p1 = i;
  }
  REP(i,m,(1<<n)) {
    if( A[p2] < A[i] ) p2 = i;
  }
  if( A[p1] < A[p2] ) {
    cout << p1 + 1 << endl;
  } else {
    cout << p2 + 1 << endl;
  }
  
  return 0;
}

Submission Info

Judge Result