The Way to Home（动态规划，模拟）

A frog lives on the axis Ox and needs to reach home which is in the point n. She starts from the point 1. The frog can jump to the right at a distance not more than d. So, after she jumped from the point x she can reach the point x + a, where a is an integer from 1 to d.

For each point from 1 to n is known if there is a lily flower in it. The frog can jump only in points with a lilies. Guaranteed that there are lilies in the points 1 and n.

Determine the minimal number of jumps that the frog needs to reach home which is in the point n from the point 1. Consider that initially the frog is in the point 1. If the frog can not reach home, print -1.

Input
The first line contains two integers n and d (2 ≤ n ≤ 100, 1 ≤ d ≤ n - 1) — the point, which the frog wants to reach, and the maximal length of the frog jump.

The second line contains a string s of length n, consisting of zeros and ones. If a character of the string s equals to zero, then in the corresponding point there is no lily flower. In the other case, in the corresponding point there is a lily flower. Guaranteed that the first and the last characters of the string s equal to one.

Output
If the frog can not reach the home, print -1.

In the other case, print the minimal number of jumps that the frog needs to reach the home which is in the point n from the point 1.

Examples
Input
8 4
10010101
Output
2
Input
4 2
1001
Output
-1
Input
8 4
11100101
Output
3
Input
12 3
101111100101
Output
4
Note
In the first example the from can reach home in two jumps: the first jump from the point 1 to the point 4 (the length of the jump is three), and the second jump from the point 4 to the point 8 (the length of the jump is four).

In the second example the frog can not reach home, because to make it she need to jump on a distance three, but the maximum length of her jump equals to two.

#include<bits/stdc++.h>
using namespace std;
int main()
{
    char s[102];
    int n,d;
    cin>>n>>d;
    getchar();
    for(int i = 1; i <= n; i++)
    {
       cin>>s[i];
    }
    int i = 1;
    int ans = 0;
    while(i <= n)
    {
        int j = i + d;//每次从起点跳最远到达的下标
        if(j > n) //如果从起点跳的最远下标超过了n肯定可达并结束
        {
            ans++;
            break;
        }
        int flag = 0;
        while(j > i)
        {
            if(s[j] == '1') //找到第一个1停止
            {
                ans++;
                flag = 1;
                i = j;
                break;
            }
            j--;
        }
        if(i == n)
            break;
        if(!flag)
        {
            cout<<"-1"<<endl;
            return 0;
        }
    }
    cout<<ans<<endl;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
const int N=1e4+5;
int x[N],dp[N];
char str[N];
int main()
{
    int n,d;
    cin>>n>>d;
    scanf("%s",str+1);
    for(int i=1; i<=n; i+=1)
    {
        dp[i]=N;
    }
    dp[1]=0;
    for(int p=1; p<n; p+=1)
    {
        for(int s=1; s<=d; s+=1)
        {
            if(s+p>n)
                break;
            if(str[s+p]=='1')
                dp[p+s]=min(dp[p+s],dp[p]+1);
        }
        //printf("%d\n",dp[p]);
    }
    if(dp[n]==N)
        printf("-1\n");
    else
        printf("%d\n",dp[n]);

    return 0;
}