Consecutive Deletions

You are given a positive integer $K$ and a sequence $A_1, A_2, \ldots, A_N$. Initially, each element of this sequence is $0$ or $1$; your goal is to make all elements equal to $0$. In order to do that, you may perform the following operation any number of times: - Choose a subarray (a contiguous subsequence) with length $K$, i.e. choose two indices $L$ and $R$ such that $1 \le L \le R \le N$ a