#1192372 (PyPy3) No.3760 Streaming Schedule

• 問題: No.3760 Streaming Schedule
• ユーザー: sig
• 提出日時: 2026-10-09 22:17:36
• 言語: PyPy3 (7.3.23 + ACL)
• 結果: AC
• 実行時間: 396 ms / 2,000 ms
• コード長: 4,100 bytes
• コンパイル時間: 66 ms
• コンパイル使用メモリ: 83,296 KB
• 実行使用メモリ: 165,288 KB
• 最終ジャッジ日時: 2026-10-09 22:17:45
• 合計ジャッジ時間: 8,761 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge5_0

ファイルパターン	結果
sample	AC * 3
other	AC * 47

ソースコード

import typing

def _ceil_pow2(n: int) -> int:
    x = 0
    while (1 << x) < n:
        x += 1

    return x


def _bsf(n: int) -> int:
    x = 0
    while n % 2 == 0:
        x += 1
        n //= 2

    return x


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 = _ceil_pow2(self._n)
        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])


#https://atcoder.jp/contests/awc0042/submissions/74755385
n,m,k = map(int, input().split())
a = list(map(int, input().split()))
rui = [0]*(n+1)
for i in range(n):
  rui[i+1] = rui[i]+a[i]
dp = [[0]*2 for _ in range(n+1)]

def op(x,y):
  return max(x,y)
st0 = SegTree(op, -10**18, n+1)
st1 = SegTree(op, -10**18, n+1)
dp[0][0] = 0
dp[0][1] = 0
st0.set(0,0)
st1.set(0,0)

for i in range(1,n+1):
    dp[i][0] = st1.prod(max(0,i-m+1),i) - rui[i]
    dp[i][1] = st0.prod(max(0,i-k+1),i) + rui[i]
    st0.set(i,dp[i][0])
    st1.set(i,dp[i][1])
#print(dp)
print(max(dp[-1][0]+rui[-1],dp[-1][1]))