Alitaulukot

#include <iostream>
#include <vector>

int main() {
    long long n;
    std::cin >> n;
    long long k;
    std::cin >> k;
    std::vector<long long> numbers;
    for (int i = 0; i < n; i++) {
        long long num;
        std::cin >> num;
        numbers.push_back(num);
    }

    long long count = 0;
    long long last_valid = 0;
    long long max = -1;
    long long min = -1;
    long long start = 0;
    bool done = false;
    for (long long i = 0; i < n; i++) {
        long long number = numbers[i];
        // std::cout << "Index is " << i << std::endl;
        if (number > max) {
            max = number;
        }
        if (number < min || min == -1) {
            min = number;
        }
        // std::cout << "Max: " << max << std::endl;
        // std::cout << "Min: " << min << std::endl;

        if (i + 1 == n) {
            done = true;
            // Setting i to an invalid thing
            i++;
        }
        if (max - min > k || done) {
            min = number;
            max = number;
            count += (i - last_valid + 1) * (i - last_valid) / 2;
            // std::cout << "Incrementing by " << (i - last_valid + 1) * (i - last_valid) / 2 << std::endl;
            if (last_valid != 0) {
                count -= (start - last_valid + 1) * (start - last_valid) / 2;
                // std::cout << "Decrementing by " << (start - last_valid + 2) * (start - last_valid + 1) / 2 << std::endl;
                // std::cout << "... because start - last_valid = " << start << " - " << last_valid << std::endl;
            }
            if (done) {
                // std::cout << "Ok we're done here" << std::endl;
                break;
            }
            start = i;
            long long j = i - 1;
            long long temp_max = numbers[i];
            long long temp_min = numbers[i];

            while (true) {
                long long temp_num = numbers[j];
                // std::cout << "Going back in time to " << temp_num << std::endl;
                if (temp_num > temp_max) {
                    temp_max = temp_num;
                }
                if (temp_num < temp_min) {
                    temp_min = temp_num;
                }
                if (temp_max - temp_min > k) {
                    // std::cout << "Let's stop going back in time" << std::endl;
                    max = numbers[i];
                    // std::cout << "Setting min to " << numbers[i] << std::endl;
                    min = numbers[i];
                    last_valid = j + 1;
                    break;
                }
                j--;
            }
            i--;
        }
    }

    std::cout << count << std::endl;

    return 0;
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 1, 2, 3

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 8

Group: 2, 3

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: WRONG ANSWER

Test 17

Group: 3

Verdict: WRONG ANSWER