結果
問題 | No.2854 -1 Subsequence |
ユーザー | rlangevin |
提出日時 | 2024-09-10 00:46:11 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,556 bytes |
コンパイル時間 | 375 ms |
コンパイル使用メモリ | 82,380 KB |
実行使用メモリ | 112,592 KB |
最終ジャッジ日時 | 2024-09-10 00:46:22 |
合計ジャッジ時間 | 9,162 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 244 ms
109,252 KB |
testcase_01 | AC | 218 ms
109,272 KB |
testcase_02 | AC | 234 ms
109,624 KB |
testcase_03 | AC | 193 ms
93,076 KB |
testcase_04 | AC | 262 ms
112,420 KB |
testcase_05 | AC | 197 ms
96,968 KB |
testcase_06 | AC | 127 ms
86,344 KB |
testcase_07 | AC | 243 ms
112,592 KB |
testcase_08 | AC | 93 ms
79,932 KB |
testcase_09 | AC | 191 ms
99,620 KB |
testcase_10 | AC | 301 ms
108,552 KB |
testcase_11 | AC | 290 ms
108,648 KB |
testcase_12 | AC | 272 ms
108,468 KB |
testcase_13 | AC | 274 ms
108,620 KB |
testcase_14 | AC | 279 ms
108,184 KB |
testcase_15 | AC | 310 ms
108,600 KB |
testcase_16 | AC | 274 ms
108,452 KB |
testcase_17 | AC | 285 ms
108,336 KB |
testcase_18 | AC | 272 ms
108,556 KB |
testcase_19 | AC | 286 ms
108,324 KB |
testcase_20 | AC | 296 ms
108,344 KB |
testcase_21 | AC | 294 ms
108,436 KB |
testcase_22 | AC | 277 ms
108,256 KB |
testcase_23 | AC | 32 ms
53,728 KB |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | AC | 31 ms
53,892 KB |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | AC | 32 ms
54,632 KB |
testcase_31 | WA | - |
testcase_32 | AC | 40 ms
52,620 KB |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | AC | 34 ms
53,156 KB |
testcase_36 | AC | 34 ms
53,972 KB |
testcase_37 | WA | - |
testcase_38 | AC | 35 ms
53,792 KB |
testcase_39 | WA | - |
ソースコード
class SegmentTree: def __init__(self, n, identity_e, combine_f, ): self._n = n self._size = 1 while self._size < self._n: self._size <<= 1 self._identity_e = identity_e self._combine_f = combine_f self._node = [self._identity_e] * (2 * self._size) def build(self, array): assert len(array) == self._n for index, value in enumerate(array, start=self._size): self._node[index] = value for index in range(self._size - 1, 0, -1): self._node[index] = self._combine_f( self._node[index << 1 | 0], self._node[index << 1 | 1] ) def update(self, index, value): i = self._size + index self._node[i] = value while i > 1: i >>= 1 self._node[i] = self._combine_f( self._node[i << 1 | 0], self._node[i << 1 | 1] ) def fold(self, L, R): L += self._size R += self._size value_L = self._identity_e value_R = self._identity_e while L < R: if L & 1: value_L = self._combine_f(value_L, self._node[L]) L += 1 if R & 1: R -= 1 value_R = self._combine_f(self._node[R], value_R) L >>= 1 R >>= 1 return self._combine_f(value_L, value_R) def get(self, p): return self._node[p + self._size] def max_right(self, l, f): assert 0 <= l <= self._n assert f(self._identity_e) if l == self._n: return self._n l += self._size sm = self._identity_e while True: while l % 2 == 0: l >>= 1 if not f(self._combine_f(sm, self._node[l])): while l < self._size: l <<= 1 if f(self._combine_f(sm, self._node[l])): sm = self._combine_f(sm, self._node[l]) l += 1 return l - self._size sm = self._combine_f(sm, self._node[l]) l += 1 if l & -l == l: break return self._n def min_left(self, r, f): assert 0 <= r <= self._n assert f(self._identity_e) if r == 0: return 0 r += self._size sm = self._identity_e while True: r -= 1 while r > 1 and r % 2: r >>= 1 if not f(self._combine_f(self._node[r], sm)): while r < self._size: r = 2 * r + 1 if f(self._combine_f(self._node[r], sm)): sm = self._combine_f(self._node[r], sm) r -= 1 return r + 1 - self._size sm = self._combine_f(self._node[r], sm) if r & -r == r: break return 0 def __str__(self): temp = [] for i in range(self._n): temp.append(str(self.fold(i, i + 1))) return ' '.join(temp) N = int(input()) A = list(map(int, input().split())) inf = 10 ** 18 dp0 = SegmentTree(N + 1, -inf, max) dp1 = SegmentTree(N + 1, -inf, max) dp1.update(0, 0) for i in range(N): v0 = dp1.fold(0, i + 1) - A[i] v1 = dp0.fold(0, i + 1) + A[i] dp0.update(i + 1, v0) dp1.update(i + 1, v1) print(max(dp0.fold(0, N + 1), dp1.fold(0, N + 1)))