sliing_window_min.py

# collections.deque 如何？
# https://leetcode.com/problems/sliding-window-maximum/
dq = collections.deque() # dq keeps track of min(d[i] + a[i]) from i-1 to i-k
d[i] = dq[-1]

while len(dp) and dq[-1][0] >= d[i] + a[i]:
    dq.pop()

dq.append((d[i] + a[i], i))

if dq[0][1] == i - k:
    dp.popleft()