Alitaulukot

/**
 * Datatähti 2021 alku
 * Alitaulukot/Subtables
 * @author TRS
 */
//Include
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <list>
#include <queue>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <regex>
//Definitions
using namespace std;
using ll = long long;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
#define pb push_back
#define mp make_pair
#define mt make_tuple
//Constants
#define infinity 0x3f3f3f3f
#define linfinity 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007
const int MX = 100001;
int a[MX];
int n, k;
ll solve(int a[], int k) {
    ll answer = n;
    int leftPointer = 0;
    int rightPointer = 1;
    int minimum = min(a[0], a[1]);
    int maximum = max(a[0], a[1]);
    while (true) {
        maximum = max(maximum, a[rightPointer]);
        minimum = min(minimum, a[rightPointer]);
        if (maximum - minimum <= k) {
            answer++;
            if (rightPointer != n - 1) {
                rightPointer++;
            }
            else {
                answer += rightPointer - leftPointer - 1;
                break;
            }
        }
        else {
            if (leftPointer != n - 2) {
                leftPointer++;
                rightPointer--;
                maximum = *max_element(a + leftPointer, a + rightPointer + 1);
                minimum = *min_element(a + leftPointer, a + rightPointer + 1);
                if (leftPointer >= rightPointer) {
                    rightPointer = leftPointer + 1;
                    if (rightPointer == n - 1 && leftPointer == n - 2) {
                        if (abs(a[rightPointer] - a[leftPointer]) <= k) {
                            answer++;
                        }
                        break;
                    }
                }
            }
            else {
                break;
            }
        }
    }
    return answer;
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n>>k;
    for (int i = 0; i < n; i++) {
        cin>>a[i];
    }
    cout<<solve(a, k);
    return 0;
}

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 5

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 6

Group: 2, 3

Verdict: WRONG ANSWER

Test 7

Group: 2, 3

Verdict: WRONG ANSWER

Test 8

Group: 2, 3

Verdict: WRONG ANSWER

Test 9

Group: 2, 3

Verdict: WRONG ANSWER

Test 10

Group: 2, 3

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: WRONG ANSWER

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: WRONG ANSWER

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED