1 \(s / 64\) \(MB / 80\) points

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 i ^{th}{ } desk will ring if the phone at j ^{th}{ } desk rings, which is at most D desks away from the
i ^{th}{ } desk. In other words, it holds | \(j - i\)

| ≤ 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?

In test cases worth 40 points in total, it will hold \(1 \le N \le 20\).

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 i ^{th}{ } desk from the
left has a phone on it, otherwise the i ^{th}{ } desk is empty.

The first and only line of output must contain the required minimal number of phones.

생성자가 기록되지 않았습니다.

출처 COCI 2016/2017 Contest 6