結果

問題 No.505 カードの数式2
ユーザー McGregorshMcGregorsh
提出日時 2022-10-30 23:02:32
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,475 bytes
コンパイル時間 902 ms
コンパイル使用メモリ 86,860 KB
実行使用メモリ 92,752 KB
最終ジャッジ日時 2023-09-21 20:49:15
合計ジャッジ時間 12,720 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 262 ms
92,260 KB
testcase_01 AC 258 ms
92,268 KB
testcase_02 AC 258 ms
92,256 KB
testcase_03 AC 259 ms
92,128 KB
testcase_04 AC 258 ms
92,256 KB
testcase_05 AC 264 ms
92,308 KB
testcase_06 AC 262 ms
91,992 KB
testcase_07 AC 261 ms
92,224 KB
testcase_08 AC 260 ms
92,096 KB
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 262 ms
92,172 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 259 ms
92,148 KB
testcase_21 AC 259 ms
92,012 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys, re
from fractions import Fraction
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque, defaultdict
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement, permutations
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext, ROUND_HALF_UP
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
def get_distance(x1, y1, x2, y2):
	  d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
	  return d
def rotate(table):
   	  n_fild = []
   	  for x in zip(*table[::-1]):
   	  	  n_fild.append(x)
   	  return n_fild
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
MOD = 10 ** 9 + 7
MOD2 = 998244353


###関数コピーしたか？###
def main():
   
   N = int(input())
   A = i_list()
   
   dp = [[-INF] * 4 for i in range(N+1)]
   for i in range(4):
   	  dp[0][i] = 0
   	  
   for i in range(N):
   	  cost = A[i]
   	  for j in range(4):
   	  	  point = dp[i][j]
   	  	  dp[i+1][0] = max(dp[i+1][0], dp[i][0] + cost, dp[i][1] + cost, dp[i][2] + cost, dp[i][3] + cost)
   	  	  dp[i+1][1] = max(dp[i+1][1], dp[i][0] - cost, dp[i][1] - cost, dp[i][2] - cost, dp[i][3] - cost)
   	  	  if dp[i][0] == -INF:
   	  	  	  a = -INF
   	  	  else:
   	  	  	  a = dp[i][0] * cost
   	  	  if dp[i][1] == -INF:
   	  	  	  b = -INF
   	  	  else:
   	  	  	  b = dp[i][1] * cost
   	  	  if dp[i][2] == -INF:
   	  	  	  c = -INF
   	  	  else:
   	  	  	  c = dp[i][2] * cost
   	  	  if dp[i][3] == -INF:
   	  	  	  d = -INF
   	  	  else:
   	  	  	  d = dp[i][3] * cost
   	  	  dp[i+1][2] = max(dp[i+1][2], a, b, c, d)
   	  	  if cost == 0:
   	  	  	  continue
   	  	  dp[i+1][3] = max(dp[i+1][3], dp[i][0] // cost, dp[i][1] // cost, dp[i][2] // cost, dp[i][3] // cost)
   	  	  dp[i+1][2] = max(dp[i+1])
   #print(dp)
   print(max(dp[N]))
   
if __name__ == '__main__':
    main()
0