#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
#include <stack>
#include <limits.h>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <cstring>
#include <sstream>
#pragma GCC target("popcnt")
typedef long long ll;
typedef long double ld;
using namespace std;
const int MOD=1e9+7;
typedef pair<ll,ll>point;
//#define x first
//#define y second
int n,x;
int arr[200000];
int dp1[200000];
int dp2[200000];
int dp3[200000];
int main(){
ios::sync_with_stdio(false);
cout.tie(NULL);
cin.tie(NULL);
//freopen("speeding.in","r",stdin);
//freopen("speeding.out","w",stdout);
cin>>n>>x;
for(int i=0;i<n;i++)
cin>>arr[i];
vector<int>vec;
for(int curr=0;curr<n;curr++){
int l=-1,r=(int)vec.size();
while(l!=r-1){
int mid=(l+r)/2;
if(vec[mid]>=arr[curr])
r=mid;
else
l=mid;
}
int i=r;
if(i==(int)vec.size())
vec.push_back(arr[curr]);
vec[i]=min(vec[i],arr[curr]);
dp1[curr]=i+1;
}
vec.clear();
for(int curr=n-1;curr>=0;curr--){
int l=-1,r=(int)vec.size();
while(l!=r-1){
int mid=(l+r)/2;
if(vec[mid]<=arr[curr]-x)
r=mid;
else
l=mid;
}
dp3[curr]=r+1;
l=-1;
r=(int)vec.size();
while(l!=r-1){
int mid=(l+r)/2;
if(vec[mid]<=arr[curr])
r=mid;
else
l=mid;
}
int i=r;
if(i==(int)vec.size())
vec.push_back(arr[curr]);
vec[i]=max(vec[i],arr[curr]);
dp2[curr]=i+1;
}
int res=0;
for(int i=0;i<n;i++)
res=max(res,dp1[i]+dp3[i]-1);
cout<<res<<"\n";
return 0;
}
/*
8 10
7 3 5 12 2 7 3 4
*/
