单点时限: 1.0 sec
内存限制: 256 MB
There are $N$ desks in a room, placed from left to right, one next to each other. Some desks have phones on them, whereas some desks are empty. All phones are broken, so the phone on the ith desk will ring if the phone at jth desk rings, which is at most $D$ desks away from the $i$th desk. In other words, it holds $|j - i| \le D$. The first and the last desk will always have a phone on them. In the beginning the leftmost phone rings. What is the minimal amount of new phones to be placed on the desks so that the last phone rings?
The first line of input contains two positive integers, $N$ ($1 \le N \le 300~000$) and $D$ ($1 \le D \le N$).
The following line contains $N$ numbers $0$ or $1$. If the $i$th number is $1$, then the ith desk from the left has a phone on it, otherwise the ith desk is empty.
The first and only line of output must contain the required minimal number of phones.
5 2 1 0 0 0 1
1
4 1 1 0 1 1
1
8 2 1 1 0 0 1 0 0 1
2
In test cases worth $40$ points in total, it will hold $1 \le N \le 20$.