Alitaulukot

#include <iostream>
#include <vector>
#include <algorithm>
#include <typeinfo>

#define ll long long

using namespace std;

ll int s(ll int n){
    return (n*(n+1))/2;
}

int main(){
    int n;
    ll int k;
    int c = 0;
    ll int r = 0;
    cin >> n >> k;
    vector<ll int> a(n);
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }

    ll int min = a[0];
    ll int max = a[0];
    int distmax = 0;
    int distmin = 0;
    int distbreak = 0;
    for (auto it = a.begin(); it != a.end(); ++it){
        if(*it > max){
            //cout << "new max "<< *it << " dist from last: " << distmax <<"\n";
            distmax = 0;
            max = *it;
            if(max - min > k){
                auto oit = it;
                r += s(c);
                //cout << " broken by new max " << max << " going back to break: back " << distbreak << ": " << *(oit - distbreak) << "\n"; 
                //cout << " adding c " << c << "\n";
                c = 0; // start here as following loop is executed atleast once
                min = *it;
                while(max - *(it-1) <= k && (it-1) != (oit-distbreak)){
                    c++;
                    it--;
                    if(*it < min){
                        min = *it;
                    }
                    //cout << " while: " << *it << "\n";
                }
                //cout << " after while ended up in " << *it << " with c of " << c << " and max of " << max << " and min of " << min << " and removing of " << c << "\n";
                //distmin = 0;
                //distmax = 0;
                it += c;
                r -= s(c); // remove already added c
                //cout << " ended in " << *it << "\n";
                distbreak = c;
            }
        }
        if(*it < min){
            //cout << "new min "<< *it << " dist from last: " << distmin <<"\n";
            distmin = 0;
            min = *it;
            if(max - min > k){
                auto oit = it;
                r += s(c);
                //cout << " broken by new min " << min << " going back to break: back " << distbreak << ": " << *(oit - distbreak) << "\n"; 
                //cout << " adding c " << c << "\n";
                c = 0;
                max = *it;
                while(*(it-1) - min <= k && (it-1) != (oit-distbreak)){
                    c++;
                    it--;
                    if(*it > max){
                        max = *it;
                    }
                    //cout << " while: " << *it << "\n";
                }
                if(it == (oit - distbreak)){
                    //cout << " reached oit\n";
                }
                //cout << " after while ended up in " << *it << " with c of " << c << " and max of " << max << " and min of " << min << " and removing of " << c << "\n";
                it += c;
                r -= s(c); // remove already added c
                //cout << " ended in " << *it << "\n";
                distbreak = c;
            }
        }
        distbreak++;
        distmax++;
        distmin++;
        c++;
    }
    //cout << "remainder: " << c << "\n";
    r += s(c);

    cout << r;

    return 0;
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

Test 6

Group: 2, 3

Verdict: ACCEPTED

Test 7

Group: 2, 3

Verdict: ACCEPTED

Test 8

Group: 2, 3

Verdict: ACCEPTED

Test 9

Group: 2, 3

Verdict: ACCEPTED

Test 10

Group: 2, 3

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED