結果

問題 No.2889 Rusk
ユーザー tassei903
提出日時 2024-09-13 23:38:08
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 291 ms / 2,000 ms
コード長 1,098 bytes
コンパイル時間 441 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 144,348 KB
最終ジャッジ日時 2024-09-13 23:38:20
合計ジャッジ時間 10,982 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 52
権限があれば一括ダウンロードができます

ソースコード

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

import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
n = ni()
a = na()
b = na()
c = na()
inf = 10**18
dp = [[-inf] * 5 for i in range(n+1)]
dp[0] = [0] * 5
for i in range(n):
    dp[i+1][0] = dp[i][0] + a[i]
    dp[i+1][1] = dp[i][1] + b[i]
    dp[i+1][2] = dp[i][2] + c[i]
    dp[i+1][3] = dp[i][3] + b[i]
    dp[i+1][4] = dp[i][4] + a[i]
    for j in range(4):
        dp[i+1][j+1] = max(dp[i+1][j+1], dp[i+1][j])
A = max(dp[n])
inf = 10**18
dp = [[-inf] * 5 for i in range(n+1)]
dp[0] = [0] * 5
for i in range(n):
    dp[i+1][0] = dp[i][0] + a[i]
    dp[i+1][1] = dp[i][1] + b[i]
    dp[i+1][2] = dp[i][2] + a[i]
    dp[i+1][3] = dp[i][3] + b[i]
    dp[i+1][4] = dp[i][4] + a[i]
    for j in range(4):
        dp[i+1][j+1] = max(dp[i+1][j+1], dp[i+1][j])
B = max(dp[n])
print(max(A,B))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0