Alitaulukot

input/code.cpp: In function 'int getMin(int, int)':
input/code.cpp:38:11: warning: unused variable 'storage' [-Wunused-variable]
       int storage = a;
           ^~~~~~~
input/code.cpp: In function 'int getMax(int, int)':
input/code.cpp:55:11: warning: unused variable 'storage' [-Wunused-variable]
       int storage = a;
           ^~~~~~~

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
 
using namespace std;
 
int N = 2; // Segmenttipuiden koko
vector<int> minTree;
vector<int> maxTree;
 
int n; // Taulukon koko
int maxDiff; // Suurin sallittu erotus
int answer;
vector<pair<int, int>> v; // Syötteenä annettu taulukko
set<pair<int, int>> s;
map<int, int> m;

void updateMin(int k, int x) {
    k += n;
    minTree[k] = x;
    for (k /= 2; k >= 1; k /= 2) {
      minTree[k] = min(minTree[2*k],minTree[2*k+1]);
    }
}
 
void updateMax(int k, int x) {
    k += n;
    maxTree[k] = x;
    for (k /= 2; k >= 1; k /= 2) {
      maxTree[k] = max(maxTree[2*k],maxTree[2*k+1]);
    }
}
 
int getMin(int a, int b) {
    if (a > b) {
      int storage = a;
      a = b;
      b = a;
    }

    a += n; b += n;
    int x = minTree[a];
    while (a <= b) {
        if (a%2 == 1) x = min(x,minTree[a++]);
        if (b%2 == 0) x = min(x,minTree[b--]);
        a /= 2; b /= 2;
    }
    return x;
}
 
int getMax(int a, int b) {
    if (a > b) {
      int storage = a;
      a = b;
      b = a;
    }

    a += n; b += n;
    int x = maxTree[a];
    while (a <= b) {
        if (a%2 == 1) x = max(x,maxTree[a++]);
        if (b%2 == 0) x = max(x,maxTree[b--]);
        a /= 2; b /= 2;
    }
    return x;
}
 
int main() {
  cin >> n >> maxDiff;
 
  while (N < n * 2) {
    N *= 2;
  }
 
  minTree.resize(N);
  maxTree.resize(N);
  for (int i = 1; i < N; i++) {
    minTree[i] = 1000000001;
    maxTree[i] = -1;
  }
 
  v.resize(n);
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    v[i] = make_pair(x, 1);
    s.insert(make_pair(x, i));
    updateMin(i, x);
    updateMax(i, x);
  }

  for (int i = 0; i < n; i++) {
    auto it = s.lower_bound({ v[i].first-maxDiff, 1});
    int minIndex = n;

    while (it != s.end()) {

      if ((*it).first > v[i].first+maxDiff) break;
      else {
        if ((*it).second != i
          && v[(*it).second].second == 1
          && (*it).second > i)
            {
          if ((*it).second < minIndex) minIndex = (*it).second;
        }
      }

      v[i].second = 0;
      it++;
    }

    m[i] = minIndex;
    s.erase(make_pair(v[i].first, i));
  }

  for (int i = 0; i < n; i++) {
    int minimum = getMin(i, m[i]);
    int maximum = getMax(i, m[i]);

    for (int j = m[i]; j < n; j++) {
      if (v[j].first < minimum) minimum = v[j].first;
      if (v[j].first > maximum) maximum = v[j].first;
 
      if (abs(minimum - maximum) <= maxDiff) answer++;
    }
  }
 
  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: 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