Submission #2874939

---

Source Code Expand

def i1():
 return int(input())
def i2():
 return [int(i) for i in input().split()]
n=i1()
a=i2()
a.append(0)
b=[0,0]
c=[0,0]
k=[[0,0]for i in range(1<<n)]
for i in range(1<<n):
 v=[i,-1]
 for j in range(18):
   if 1<<j & i:
      v.append(k[i-(1<<j)][0])
      v.append(k[i-(1<<j)][1])
 v=list(set(v))
 v=sorted(v,key=lambda x:a[x])
 k[i][0]=v[-1]
 k[i][1]=v[-2]
d=0
for i in range(1,1<<n):
 d=max(d,a[k[i][0]]+a[k[i][1]])
 print(d)

Submission Info

Judge Result