Is there a bug in last line of the main algo:
for i in W+1 to N, inclusive
Q.push(A[i])
Q.pop()
Mi[i-W<b>+1</b>] = Q.min()
Is there a bug in last line of the main algo:
for i in W+1 to N, inclusive
Q.push(A[i])
Q.pop()
Mi[i-W<b>+1</b>] = Q.min()