716A - Crazy Computer - CodeForces Solution

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ll       long long int
#define lu       unsigned long long int
#define pb       push_back
#define pf       push_front
#define mod      1000000007
#define MAX      1000004
#define fast     ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
using namespace __gnu_pbds;

typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds; // find_by_order, order_of_key

const ll inf = (ll)1e18;
const ll N = (ll)1e6+9;
const ll MOD = (ll)1e9+7;
vector<ll>adj[N];
//top->bottom->left->right->top-left->top-right->bottom-left->bottom-right
ll dx[] = {-1, 1,  0, 0, -1, -1,  1, 1};
ll dy[] = {0,  0, -1, 1, -1,  1, -1, 1};


bool desc(pair<ll,ll>a,pair<ll,ll> b)
{
    if(a.first>b.first) return true;
    else return false;
}

ll findLowerBound(vector<pair<ll, ll> >& arr,pair<ll,ll>&p)
{
    ll up = lower_bound(arr.begin(), arr.end(), p)-arr.begin();
    return up;
}
void solve()
{
    ll n,i,j,k,c;
    cin>>n>>c;
    ll a[n];
    for(i=0;i<n;i++) cin>>a[i];
    ll cnt=1;
    for(i=0;i<n-1;i++){
        ll d=a[i+1]-a[i];
        //cout<<d<<endl;
        if(d>c){
            cnt=1;
        }else
            cnt++;
    }
    cout<<cnt<<endl;
}


int main()
{
    fast;
    ll t=1,c=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}