Alitaulukot

#include <iostream>
#include <vector>
#include <algorithm>
 
using namespace std;
 
int main(){
    unsigned int n, k;
    unsigned int c = 0;
    cin >> n >> k;
    vector<unsigned int> a(n);
    for(unsigned int i = 0; i < n; i++){
        cin >> a[i];
    }
 
    for(auto it1 = a.begin(); it1 != a.end(); ++it1){
        unsigned int min = *it1;
        unsigned int max = *it1;
        for (auto it2 = it1; it2 != a.end(); ++it2){
            if (*it2 < min || min == 0){
                min = *it2;
            }
            if(*it2 > max || max == 0){
                max = *it2;
            }
            if(max - min <= k){
                c++;
            }else{
                break;
            }
        }
    }
 
    cout << c;
 
    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: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED