Codeforces 716A Crazy Computer 【模拟】 (Codeforces Round #372 (Div. 2))

A. Crazy Computer

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

ZS the Coder is coding on a crazy computer. If you don't type in a word for a c consecutive seconds, everything you typed disappear!

More formally, if you typed a word at second a and then the next word at second b, then if b - a ≤ c, just the new word is appended to other words on the screen. If b - a > c, then everything on the screen disappears and after that the word you have typed appears on the screen.

For example, if c = 5 and you typed words at seconds 1, 3, 8, 14, 19, 20 then at the second 8 there will be 3 words on the screen. After that, everything disappears at the second 13 because nothing was typed. At the seconds 14 and 19 another two words are typed, and finally, at the second 20, one more word is typed, and a total of 3 words remain on the screen.

You're given the times when ZS the Coder typed the words. Determine how many words remain on the screen after he finished typing everything.

Input

The first line contains two integers n and c (1 ≤ n ≤ 100 000, 1 ≤ c ≤ 109) — the number of words ZS the Coder typed and the crazy computer delay respectively.

The next line contains n integers t1, t2, ..., tn (1 ≤ t1 < t2 < ... < tn ≤ 109), where ti denotes the second when ZS the Coder typed the i-th word.

Output

Print a single positive integer, the number of words that remain on the screen after all n words was typed, in other words, at the secondtn.

Examples

input

6 5
1 3 8 14 19 20

output

3

input

6 1
1 3 5 7 9 10

output

2

Note

The first sample is already explained in the problem statement.

For the second sample, after typing the first word at the second 1, it disappears because the next word is typed at the second 3 and3 - 1 > 1. Similarly, only 1 word will remain at the second 9. Then, a word is typed at the second 10, so there will be two words on the screen, as the old word won't disappear because 10 - 9 ≤ 1.

 

题目链接：

　　http://codeforces.com/contest/716/problem/A

题目大意：

　　给你一个N(N<=100000)个字母敲击的时间a[i](a[i]<=10⁹)，如果在M时间内没有敲击那么屏幕就清零，否则屏幕上就多一个字母，问最后屏幕剩下几个字母。

题目思路：

　　【模拟】

　　从后往前做，只要找到第一个间隔超过M的就停止，统计当前的字母数量即可。

 

//
//by coolxxx
//#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<iomanip>
#include<map>
#include<stack>
#include<queue>
#include<set>
#include<bitset>
#include<memory.h>
#include<time.h>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
//#include<stdbool.h>
#include<math.h>
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define abs(a) ((a)>0?(a):(-(a)))
#define lowbit(a) (a&(-a))
#define sqr(a) ((a)*(a))
#define swap(a,b) ((a)^=(b),(b)^=(a),(a)^=(b))
#define mem(a,b) memset(a,b,sizeof(a))
#define eps (1e-10)
#define J 10000
#define mod 1000000007
#define MAX 0x7f7f7f7f
#define PI 3.14159265358979323
#pragma comment(linker,"/STACK:1024000000,1024000000")
#define N 100004
using namespace std;
typedef long long LL;
double anss;
LL aans;
int cas,cass;
int n,m,lll,ans;
int a[N];
int main()
{
    #ifndef ONLINE_JUDGEW
//    freopen("1.txt","r",stdin);
//    freopen("2.txt","w",stdout);
    #endif
    int i,j,k;
    int x,y,z;
//    init();
//    for(scanf("%d",&cass);cass;cass--)
//    for(scanf("%d",&cas),cass=1;cass<=cas;cass++)
//    while(~scanf("%s",s))
    while(~scanf("%d",&n))
    {
        ans=1;
        scanf("%d",&m);
        for(i=1;i<=n;i++)
            scanf("%d",&a[i]);
        for(i=n;i>1;i--)
        {
            if(a[i]-a[i-1]>m)break;
            ans++;
        }
        printf("%d\n",ans);
    }
    return 0;
}
/*
//

//
*/