Alitaulukot

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

int main() {
	int n, k;
	std::cin>> n >> k;
	int x[n];

	std::vector<int> start;
	for (int i = 0; i < n; i++) {
		//int in;
		std::cin>> x[i];
		//start.push_back(in);
		//start.push_back(in);
	}
	// now input is done

	int calcs = 0, res = n; // result is always at least n

	/*
	std::vector<int> nodes = start;
	int max, min, mult = 0;
	for (int i = 3; i < n*4; i=i+4) {
		//if (x[i] > max) { max = x[i]; res++; }
		//else if (x[i] < min) { min = x[i]; res++; }
		//else { mult++; }
		nodes = start;
		start.clear();
		start.push_back(*std::max_element(nodes.data()+i, nodes.data()+i+4));
		calcs++;
	}*/
	for (int a = 0; a < n-1; a++) {
		for (int b = a+1; b < n; b++) {
			if (*std::max_element(x+a, x+b+1)-*std::min_element(x+a, x+b+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