#include <bits/stdc++.h>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define getbit(x) (((x) >> (i)) & 1)
#define TASK ""
using namespace std;
template <typename T1, typename T2> bool maxi(T1 &a, T2 b) {
if (a < b) a = b; else return false; return true;
}
template <typename T1, typename T2> bool mini(T1 &a, T2 b) {
if (a > b) a = b; else return false; return true;
}
const long long inf = 1e18;
const int mod = 1e9 + 7;
const int N = 3e5 + 5;
int n;
int d;
int a[N];
namespace subtask2 {
int dp[405][405];
vector <int> value;
void solve() {
for (int i = 1; i <= n; ++i) value.push_back(a[i]);
sort(all(value));
value.erase(unique(all(value)), value.end());
int m = (int) value.size();
for (int i = 1; i <= n; ++i) {
a[i] = lower_bound(all(value), a[i]) - value.begin() + 1;
}
memset(dp, -0x3f, sizeof dp);
for (int i = 1; i <= n; ++i) dp[i][a[i]] = 1;
for (int i = 1; i <= n; ++i) {
for (int j = i - 1; j >= max(i - d, 1); --j) {
for (int mx = 1; mx <= m; ++mx) {
maxi(dp[i][max(mx, a[i])], dp[j][mx] + (mx < a[i]));
}
}
}
cout << *max_element(dp[n] + 1, dp[n] + m + 1);
}
};
namespace subtask3 {
vector <int> value;
int dp[7005][7005];
deque <int> dq[7005];
void solve() {
for (int i = 1; i <= n; ++i) value.push_back(a[i]);
sort(all(value));
value.erase(unique(all(value)), value.end());
int m = (int) value.size();
for (int i = 1; i <= n; ++i) {
a[i] = lower_bound(all(value), a[i]) - value.begin() + 1;
}
memset(dp, -0x3f, sizeof dp);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
while (dq[j].size() && dq[j].front() + d < i) dq[j].pop_front();
if (dq[j].size()) maxi(dp[i][max(a[i], j)], dp[dq[j].front()][j] + (a[i] > j));
while (dq[max(j, a[i])].size() && dp[dq[max(j, a[i])].back()][max(j, a[i])] <= dp[i][j])
dq[max(j, a[i])].pop_back();
dq[max(a[i], j)].push_back(i);
}
maxi(dp[i][a[i]], 1);
dq[a[i]].push_back(i);
}
//for (int i = 1; i <= n; ++i)
cout << *max_element(dp[n] + 1, dp[n] + m + 1);
}
};
namespace subtask4 {
stack <int> st;
void solve() {
int ans = 0;
for (int i = n; i >= 1; --i) {
while (st.size() && st.top() <= a[i]) st.pop();
st.push(a[i]);
maxi(ans, st.size());
}
cout << ans;
}
};
namespace subtask5 {
void solve() {
vector <int> dp;
for (int i = 1; i <= n; ++i) {
int p = lower_bound(all(dp), a[i]) - dp.begin();
if (p == dp.size()) dp.push_back(a[i]);
else dp[p] = a[i];
}
cout << (int) dp.size() << '\n';
}
};
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
//freopen(TASK".inp", "r", stdin);
//freopen(TASK".out", "w", stdout);
cin >> n >> d;
for (int i = 1; i <= n; ++i) cin >> a[i];
if (n <= 400) subtask2::solve();
else if (n <= 7000) subtask3::solve();
else if (d == 1) subtask4::solve();
else if (d == n) subtask5::solve();
}
