結果
問題 | No.999 てん vs. ほむ |
ユーザー | McGregorsh |
提出日時 | 2022-07-07 09:02:17 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 287 ms / 2,000 ms |
コード長 | 1,854 bytes |
コンパイル時間 | 919 ms |
コンパイル使用メモリ | 87,100 KB |
実行使用メモリ | 130,660 KB |
最終ジャッジ日時 | 2023-08-25 18:05:17 |
合計ジャッジ時間 | 8,479 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 223 ms
92,552 KB |
testcase_01 | AC | 227 ms
92,772 KB |
testcase_02 | AC | 228 ms
92,720 KB |
testcase_03 | AC | 228 ms
92,692 KB |
testcase_04 | AC | 228 ms
92,780 KB |
testcase_05 | AC | 227 ms
92,656 KB |
testcase_06 | AC | 230 ms
92,704 KB |
testcase_07 | AC | 228 ms
92,744 KB |
testcase_08 | AC | 246 ms
93,412 KB |
testcase_09 | AC | 283 ms
124,248 KB |
testcase_10 | AC | 245 ms
102,908 KB |
testcase_11 | AC | 243 ms
98,768 KB |
testcase_12 | AC | 255 ms
110,132 KB |
testcase_13 | AC | 285 ms
128,240 KB |
testcase_14 | AC | 284 ms
128,124 KB |
testcase_15 | AC | 287 ms
127,972 KB |
testcase_16 | AC | 280 ms
128,264 KB |
testcase_17 | AC | 278 ms
130,316 KB |
testcase_18 | AC | 278 ms
130,284 KB |
testcase_19 | AC | 277 ms
130,660 KB |
testcase_20 | AC | 279 ms
130,652 KB |
testcase_21 | AC | 283 ms
127,876 KB |
testcase_22 | AC | 285 ms
127,796 KB |
ソースコード
import sys, re 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 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() mae = [0] * n for i in range(n): mae[i] = A[i*2] - A[i*2+1] accumu_mae = list(accumulate(mae)) A_ = A[::-1] usiro = [0] * n for i in range(n): usiro[i] = A_[i*2] - A_[i*2+1] accumu_usiro = list(accumulate(usiro)) accumu_usiro = accumu_usiro[::-1] #print(accumu_mae) #print(accumu_usiro) ans = max(accumu_mae[-1], accumu_usiro[0]) for i in range(n-1): ans = max(ans, accumu_mae[i] + accumu_usiro[i+1]) print(ans) if __name__ == '__main__': main()