Alitaulukot

#include <bits/stdc++.h>

using namespace std;
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  int l1[n];
  int l2[n];
  int a[n];
  int f = -1;

  int s = ceil(sqrt(n));
  
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    a[i] = x;
    if (i % s == 0) {
      f++;
      l1[f] = a[i];
      l2[f] = a[i];
    }
    l1[f] = min(l1[f], a[i]);
    l2[f] = max(l2[f], a[i]);
  }
  int c = n;

   for (int i = 0; i < n; i++) {
    for (int j = (i + 1); j < n; j++) {

      int mi = 1000000;
      int ma = -1000000;

      int al = i;
      int yl = j;

      while (al < yl && al % s != 0 && al != 0) {
	if (a[al] < mi) mi = a[al];
	if (a[al] > ma) ma = a[al];
	al++;
      }

      while (al + s <= yl) {
	if (l1[al / s] < mi) mi = l1[al / s];
	if (l2[al / s] > ma) ma = l2[al / s];
	al += s;
      }
      while (al <= yl) {
	mi = min(a[al], mi);
	ma = max(a[al], ma);
	al++;
      }
      if (ma - mi <= k){	
	c++;
      }
    }
  }
  cout << c;
}

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

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