def solve(n, nums, k, q, queries):
    from collections import deque
    dp = [0] * n
    dq = deque()

    for i in range(n):
        while dq and dq[0] < i - k:
            dq.popleft()
        if dq:
            dp[i] = max(nums[i], dp[dq[0]] + nums[i])
        else:
            dp[i] = nums[i]
        while dq and dp[dq[-1]] < dp[i]:
            dq.pop()
        dq.append(i)

    return [dp[q-1] for q in queries]

All placement help available

Ascendion Exam help available:

All placement help available