結果

問題 No.2854 -1 Subsequence
ユーザー rlangevinrlangevin
提出日時 2024-09-10 00:50:08
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 309 ms / 2,000 ms
コード長 3,557 bytes
コンパイル時間 425 ms
コンパイル使用メモリ 82,560 KB
実行使用メモリ 112,624 KB
最終ジャッジ日時 2024-09-10 00:50:18
合計ジャッジ時間 8,707 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 240 ms
109,708 KB
testcase_01 AC 234 ms
109,148 KB
testcase_02 AC 261 ms
109,220 KB
testcase_03 AC 190 ms
92,728 KB
testcase_04 AC 275 ms
112,624 KB
testcase_05 AC 205 ms
97,112 KB
testcase_06 AC 137 ms
86,392 KB
testcase_07 AC 258 ms
112,520 KB
testcase_08 AC 92 ms
79,568 KB
testcase_09 AC 204 ms
99,500 KB
testcase_10 AC 309 ms
108,332 KB
testcase_11 AC 308 ms
108,348 KB
testcase_12 AC 283 ms
108,328 KB
testcase_13 AC 275 ms
108,344 KB
testcase_14 AC 302 ms
108,480 KB
testcase_15 AC 275 ms
108,528 KB
testcase_16 AC 294 ms
108,472 KB
testcase_17 AC 290 ms
108,628 KB
testcase_18 AC 274 ms
108,496 KB
testcase_19 AC 277 ms
108,396 KB
testcase_20 AC 290 ms
108,580 KB
testcase_21 AC 285 ms
108,188 KB
testcase_22 AC 287 ms
108,388 KB
testcase_23 AC 33 ms
53,160 KB
testcase_24 AC 31 ms
54,216 KB
testcase_25 AC 39 ms
53,296 KB
testcase_26 AC 32 ms
53,216 KB
testcase_27 AC 31 ms
53,552 KB
testcase_28 AC 32 ms
53,576 KB
testcase_29 AC 32 ms
53,356 KB
testcase_30 AC 32 ms
53,380 KB
testcase_31 AC 35 ms
53,288 KB
testcase_32 AC 35 ms
54,060 KB
testcase_33 AC 31 ms
52,684 KB
testcase_34 AC 31 ms
53,216 KB
testcase_35 AC 31 ms
53,480 KB
testcase_36 AC 31 ms
53,496 KB
testcase_37 AC 32 ms
53,396 KB
testcase_38 AC 31 ms
52,592 KB
testcase_39 AC 33 ms
53,792 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

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(1, N + 1), dp1.fold(1, N + 1)))
0