Alitaulukot

#include <iostream>
#include <vector>
#include <algorithm>
 
using namespace std;
 
int n;
int k;
int answer;
vector<int> v;
int minimum;
int maximum;
bool last;

int max_in_v;
int min_in_v = 1'000'000'001;
int max_in_v_i;
int min_in_v_i;
 
int main() {
  cin >> n >> k;
  v.resize(n);
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    v[i] = x;
    if (x > max_in_v) {
      max_in_v = x;
      max_in_v_i = i;
    }
    if (x < min_in_v) {
      min_in_v = x;
      min_in_v_i = i;
    }
  }

  if (min_in_v_i > (n-1/2) || max_in_v_i > (n-1/2)) {
    reverse(v.begin(), v.end());
  }
 
  for (int i = 0; i < n; i++) {
    minimum = v[i];
    maximum = v[i];
    last = true;
    for (int j = i + 1; j < n; j++) {
      if (v[j] < minimum) minimum = v[j];
      if (v[j] > maximum) maximum = v[j];

      if (minimum == min_in_v && maximum == max_in_v) {
        if (abs(minimum - maximum) <= k) {
          answer += n - j;
        }

        break;
      }
 
      if (abs(minimum - maximum) <= k) {
        answer++;
        last = true;
      } else {
        last = false;
      }
    }
  }
 
  cout << answer + n;
}

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

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