結果

問題 No.1368 サイクルの中に眠る門松列
ユーザー flippergoflippergo
提出日時 2024-10-01 20:39:31
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 1,432 bytes
コンパイル時間 535 ms
コンパイル使用メモリ 82,252 KB
実行使用メモリ 111,768 KB
最終ジャッジ日時 2024-10-01 20:39:36
合計ジャッジ時間 4,200 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 2 WA * 13
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

T = int(input())
for _ in range(T):
N = int(input())
A = list(map(int,input().split()))
A = A+A
K0 = []
for i in range(N-3+1):
a,b,c = A[i:i+3]
if a!=b and b!=c and c!=a and (max(a,b,c)==b or min(a,b,c)==b):
K0.append(i)
M0 = len(K0)
dp0 = [0]*M0
if M0>0:
dp0[0] = A[K0[0]]
for j in range(1,M0):
dp0[j] = dp0[j-1]
i0 = K0[j-1]
i1 = K0[j]
if i1>=i0+3:
dp0[j] += A[i1]
else:
dp0 = [0]
K1 = []
for i in range(1,N-2+1):
a,b,c = A[i:i+3]
if a!=b and b!=c and c!=a and (max(a,b,c)==b or min(a,b,c)==b):
K1.append(i)
M1 = len(K1)
dp1 = [0]*M1
if M1>0:
dp1[0] = A[K1[0]]
for j in range(1,M1):
dp1[j] = dp1[j-1]
i0 = K1[j-1]
i1 = K1[j]
if i1>=i0+3:
dp1[j] += A[i1]
else:
dp1 = [0]
K2 = []
for i in range(2,N-1+1):
a,b,c = A[i:i+3]
if a!=b and b!=c and c!=a and (max(a,b,c)==b or min(a,b,c)==b):
K2.append(i)
M2 = len(K2)
dp2 = [0]*M2
if M2>0:
dp2[0] = A[K2[0]]
for j in range(1,M2):
dp2[j] = dp2[j-1]
i0 = K2[j-1]
i1 = K2[j]
if i1>=i0+3:
dp2[j] += A[i1]
else:
dp2 = [0]
print(max(dp0[-1],dp1[-1],dp2[-1]))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0