제출 #652369

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
652369		beaconmc	Hacker (BOI15_hac)	Pypy 3	0 / 100	43 ms	18728 KiB

hac

n = int(input())
lis = list(map(int, input().split()))
sussies = []
k =(n+1)//2
lis = lis + lis
cur = 0
for i in range(k):
        cur += lis[i]
sussies.append(cur)

for i in range(1,n):
    cur -= lis[i-1]
    cur += lis[i+k-1]
    sussies.append(cur)
sussies = sussies + [sussies[0]]
ans = -1
sus = set()
for i in range(k): sus.add(sussies[i])
ans = max(ans, min(sus))
for i in range(1,len(sussies)-k):
    if sussies[i-1] in sus: sus.remove(sussies[i-1])
    sus.add(sussies[i+k-1])
    ans = max(ans, min(sus))
print(ans)

• Subtask 1: 0 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 40