Alitaulukot

#include <algorithm>
#include <bits/stdc++.h>

int main() {
	int n, k;
	std::cin>> n >> k;
	int x[n];
	for (int i = 0; i < n; i++) {
		std::cin>> x[i];
	}
	// now input is done

	int calcs = 0, res = n; // result is always at least n
	for (int a = 1; a < n; a++) {
		for (int b = 0; b < n-a; b++) {
			if (*std::max_element(x+b, x+b+a+1)-*std::min_element(x+b, x+b+a+1) <= k) { res++; }
			calcs++;
		}
	}
	std::cerr<< calcs << std::endl;
	std::cout<< res << std::endl;
	return 0;
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

4950

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

4950

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

4950

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

4950

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

4950

Test 6

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

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