提出 #8528395

---

ソースコード 拡げる

import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

import numpy as np

N = int(readline())
A = np.array(read().split(),np.int64)

# 2周もつ
A = np.concatenate([A,A])

# 残サイズごとに
dp = np.zeros(N,np.int64) # size = 0
for n in range(1,N+1):
    dp = np.append(dp,dp[0])
    player = (N - n) & 1
    if player == 0:
        # JOI君
        left = dp[1:N+1] + A[:N]
        right = dp[:N] + A[n-1:N+n-1]
        dp = np.maximum(left,right)
    else:
        # IOIちゃん
        dp = np.where(A[:N] > A[n-1:N+n-1], dp[1:N+1], dp[:N])

answer = dp.max()
print(answer)

提出情報

ジャッジ結果