Submission #6517001

---

Source Code Expand

# 全部やればよい
import numpy as np
N = int(input())

A = np.array(input().split(), dtype=np.int32)
# 2つおきの累積和
A[::2] = A[::2].cumsum()
A[1::2] = A[1::2].cumsum()
A = list(A) + [0] * 10 # 負数インデックスを0値にする

def F(L,R):
  if R < L:
    L,R = R,L
  # L,R が選ばれた場合
  if (R-L)%2 == 0:
    x1 = A[R] - A[L-2]
    x2 = A[R-1] - A[L-1]
  else:
    x1 = A[R-1] - A[L-2]
    x2 = A[R] - A[L-1]
  return x1, x2

INF = 10 ** 9
answer = -INF
for i in   range(N):
  aok = -INF
  tak = None
  for j in range(N):
    if j == i:
      continue
    x1,x2 = F(i,j)
    if aok < x2:
      aok = x2
      tak = x1
  answer = max(answer, tak)

print(answer)

Submission Info

Judge Result