Submission #652366

#	Time	Username	Problem	Language	Result	Execution time	Memory
652366		beaconmc	Hacker (BOI15_hac)	Pypy 3	40 / 100	1104 ms	229176 KiB

hac

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

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