提出 #19324272

---

ソースコード 拡げる

import math
from math import gcd,pi,sqrt
INF = float("inf")
MOD = 10**9 + 7
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
import itertools
import bisect
import re
from collections import Counter,deque,defaultdict
def iinput(): return int(input())
def imap(): return map(int, input().split())
def ilist(): return list(imap())
def irow(N): return [iinput() for i in range(N)]
def sinput(): return input().rstrip()
def smap(): return sinput().split()
def slist(): return list(smap())
def srow(N): return [sinput() for i in range(N)]

def main():
    n = iinput()
    a = ilist()
    a = [[a[i],i] for i in range(2**n)]
    a = deque(a)
    while a:
        if len(a) == 2:
            print(min(a)[1]+1)
            break
        b = a.popleft()
        c = a.popleft()
        a.append(max(b,c))
        # print(a)


if __name__=="__main__":
    main() 

提出情報

ジャッジ結果