結果

問題 No.1117 数列分割
ユーザー mkawa2mkawa2
提出日時 2023-05-22 23:31:14
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 3,781 bytes
コンパイル時間 195 ms
コンパイル使用メモリ 82,252 KB
実行使用メモリ 190,756 KB
最終ジャッジ日時 2024-06-02 01:12:06
合計ジャッジ時間 20,014 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
75,792 KB
testcase_01 AC 56 ms
68,844 KB
testcase_02 AC 59 ms
69,720 KB
testcase_03 AC 693 ms
85,068 KB
testcase_04 AC 670 ms
84,224 KB
testcase_05 AC 56 ms
68,496 KB
testcase_06 AC 145 ms
80,144 KB
testcase_07 AC 165 ms
80,112 KB
testcase_08 AC 676 ms
87,380 KB
testcase_09 AC 328 ms
81,484 KB
testcase_10 AC 681 ms
87,620 KB
testcase_11 AC 2,211 ms
136,880 KB
testcase_12 AC 2,468 ms
145,256 KB
testcase_13 TLE -
testcase_14 TLE -
testcase_15 TLE -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import typing

class SegTree:
    def __init__(self,
                 op: typing.Callable[[typing.Any, typing.Any], typing.Any],
                 e: typing.Any,
                 v: typing.Union[int, typing.List[typing.Any]]) -> None:
        self._op = op
        self._e = e

        if isinstance(v, int):
            v = [e]*v

        self._n = len(v)
        self._log = (self._n-1).bit_length()
        self._size = 1 << self._log
        self._d = [e]*(2*self._size)

        for i in range(self._n):
            self._d[self._size+i] = v[i]
        for i in range(self._size-1, 0, -1):
            self._update(i)

    def set(self, p: int, x: typing.Any) -> None:
        assert 0 <= p < self._n

        p += self._size
        self._d[p] = x
        for i in range(1, self._log+1):
            self._update(p >> i)

    def get(self, p: int) -> typing.Any:
        assert 0 <= p < self._n

        return self._d[p+self._size]

    def prod(self, left: int, right: int) -> typing.Any:
        assert 0 <= left <= right <= self._n
        sml = self._e
        smr = self._e
        left += self._size
        right += self._size

        while left < right:
            if left & 1:
                sml = self._op(sml, self._d[left])
                left += 1
            if right & 1:
                right -= 1
                smr = self._op(self._d[right], smr)
            left >>= 1
            right >>= 1

        return self._op(sml, smr)

    def all_prod(self) -> typing.Any:
        return self._d[1]

    def max_right(self, left: int,
                  f: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= left <= self._n
        assert f(self._e)

        if left == self._n:
            return self._n

        left += self._size
        sm = self._e

        first = True
        while first or (left & -left) != left:
            first = False
            while left%2 == 0:
                left >>= 1
            if not f(self._op(sm, self._d[left])):
                while left < self._size:
                    left *= 2
                    if f(self._op(sm, self._d[left])):
                        sm = self._op(sm, self._d[left])
                        left += 1
                return left-self._size
            sm = self._op(sm, self._d[left])
            left += 1

        return self._n

    def min_left(self, right: int,
                 f: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= right <= self._n
        assert f(self._e)

        if right == 0:
            return 0

        right += self._size
        sm = self._e

        first = True
        while first or (right & -right) != right:
            first = False
            right -= 1
            while right > 1 and right%2:
                right >>= 1
            if not f(self._op(self._d[right], sm)):
                while right < self._size:
                    right = 2*right+1
                    if f(self._op(self._d[right], sm)):
                        sm = self._op(self._d[right], sm)
                        right -= 1
                return right+1-self._size
            sm = self._op(self._d[right], sm)

        return 0

    def _update(self, k: int) -> None:
        self._d[k] = self._op(self._d[2*k], self._d[2*k+1])

n, k, m = map(int, input().split())
a = list(map(int, input().split()))
s = [0]*(n+1)
for i in range(n): s[i+1] = s[i]+a[i]

dp = [0]+[-1]*n
for _ in range(k):
    st1 = SegTree(max, -10**9, n)
    st2 = SegTree(max, -10**9, n)
    ndp = [-1]*(n+1)
    for i in range(n+1):
        l = max(0, i-m)
        ndp[i] = max(ndp[i], st1.prod(l, i)+s[i], st2.prod(l, i)-s[i], )
        if i<n and dp[i] != -1:
            st1.set(i, dp[i]-s[i])
            st2.set(i, dp[i]+s[i])
    dp = ndp

print(dp[-1])
0