#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = (int)1e6 + 12;

int n, d, a[N], dp[N], f[N];

void prec() {
    multiset<int> st;
    st.insert(a[1]);
    for(int i = 2; i <= n; i++) {
        f[i] = (*st.begin());
        if(i - d >= 1) {
            st.erase(st.find(a[i - d]));
        }
        st.insert(a[i]);
    }
}

struct segtree{
    vector<int> t;
    void init(int s) {
        t.assign(s * 4, 0);
    }
    void upd(int pos, int val, int v, int tl, int tr) {
        if(tl == tr) {
            t[v] = val;
        } else {
            int tm = (tl + tr) >> 1;
            if(pos <= tm) upd(pos, val, v + v, tl, tm);
            else upd(pos, val, v + v + 1 , tm + 1, tr);
            t[v] = max(t[v + v], t[v + v + 1]);
        }
    }
    int get(int l, int r, int v, int tl, int tr) {
        if(l > r || tl > r || l > tr) return 0;
        if(tl >= l && tr <= r) {
            return t[v];
        }
        int tm = (tl + tr) >> 1;
        return max(get(l, r, v + v, tl, tm), get(l, r, v + v + 1, tm + 1, tr));
    }
}x, y;
vector<int> c;
void test() {
    cin >> n >> d;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        c.push_back(a[i]);
    }
    prec();
    x.init(n);
    sort(c.begin(), c.end());
    c.resize(unique(c.begin(), c.end()) - c.begin());
    int m = (int)c.size();
    for(int i = 1; i <= n; i++) {
        x.upd(i, f[i], 1, 1, n);
    }
    int res = 1;
    for(int i = 1; i <= n; i++) {
        dp[i] = max(dp[i], 1);
        int l = i + 1, r = n + 1;
        while(r - l > 1) {
            int mid = (l + r) >> 1;
            if(x.get(i + 1, mid, 1, 1, n) > a[i]) {
                r = mid;
            } else {
                l = mid;
            }
        }
        for(int j = i + 1; j <= l; j++) {
            if(f[j] > a[i]) break;
            if(a[j] > a[i]) {
                dp[j] = max(dp[j], dp[i] + 1);
            }
        }
        res = max(res, dp[i]);
    }

    cout << res << '\n';
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;
    //cin >> t;

    while(t--)
        test();

    return 0;
}