Problem:
Score : 400 points

Problem Statement

You are given a sequence A_1, A_2, ..., A_N and an integer K.

Print the maximum possible length of a sequence B that satisfies the following conditions:

B is a (not necessarily continuous) subsequence of A.

For each pair of adjacents elements of B, the absolute difference of the elements is at most K.

Constraints

1 \leq N \leq 300,000

0 \leq A_i \leq 300,000

0 \leq K \leq 300,000

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N K
A_1
A_2
:
A_N

Output

Print the answer.

Sample Input 1

10 3
1
5
4
3
8
6
9
7
2
4

Sample Output 1

7

For example, B = (1, 4, 3, 6, 9, 7, 4) satisfies the conditions.

It is a subsequence of A = (1, 5, 4, 3, 8, 6, 9, 7, 2, 4).

All of the absolute differences between two adjacent elements (|1-4|, |4-3|, |3-6|, |6-9|, |9-7|, |7-4|) are at most K = 3.

Solution in C (GCC 9.2.1) (judge verdict: Wrong Answer)

#include<stdio.h>
int S[4*300010];
int T,NN=0;
//評価関数（今はMIN）
int hyoka(int a,int b){return a>b?a:b;}
//セグ木を長さnの数列dで初期化、構成
void sset(int n){
  int i;
  for(T=1;T<n;T*=2);
  for(i=0;i<T*2;i++)S[i]=NN;
}
//セグ木のupdate関数
//i番目の数値をnに変更、再構成
void sud(int i,int n){for(S[i+=T]=n;i/=2;)S[i]=hyoka(S[i*2],S[i*2+1]);}
//セグ木のfind関数
//[a,b)区間の呼び出しはsout(a,b,1,0,T);
int sout(int a,int b,int i,int l,int r){
  if(r<=a||b<=l)return NN;
  if(a<=l&&r<=b)return S[i];
  return hyoka(sout(a,b,i*2,l,(l+r)/2),sout(a,b,i*2+1,(l+r)/2,r));
}
int sget(int a,int b){return sout(a,b,1,0,T);}
int MAX(int a,int b){return a<b?b:a;}
int MIN(int a,int b){return a<b?a:b;}
int main(){
  int n,m,i,a,b,ans=0,l,r;
  scanf("%d %d",&n,&m);
  sset(n);
  for(i=0;i<n;i++){
    scanf("%d",&a);
    l=MAX(0,a-m);
    r=MIN(T,a+m+1);
    b=sget(l,r);
    sud(a,b+1);
    ans=MAX(ans,b+1);//printf("%d %d\n",a+1,ans);
  }
  printf("%d\n",ans);
  return 0;
}