Alitaulukot

#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <algorithm>
#include <bits/stdc++.h> 
#define lint long long int
 
using namespace std;
 
lint length(lint i, lint j)
{
	return ( (j-i)  * ( (j-i) + 1) / 2) - ( (j-i-1) * ( (j-i-1) + 1) / 2);
}
 
int CalculateSubArray(lint arr[], lint n, lint k)
{
	//An adventurer will always progress or get to the same point.
	lint result = 0;
	for(lint i = 0; i < n; i++)
	{
		lint max = i;
		lint min = i;
		for(lint j = i; j < n; j++)
		{
			if(arr[j] > arr[max]) 
			{
				max = j;
			}
			if(arr[j] < arr[min])
			{
				min = j;
			}
			if(abs(arr[min] - arr[j]) > k || abs(arr[max] - arr[j]) > k)
			{
				result += length(i, j);
				break;
			}
			if(j == n-1)
			{
				result += ( (j-i+1)  * ( (j-i+1) + 1) / 2);
				goto Escape;
			}	
		}
	}
	Escape:
	return result;
}

int main()
{
	lint n;
	cin >> n;
	lint k;
	cin >> k;
	lint arr[n];
	for(lint i = 0; i < n; i++)
	{
		cin >> arr[i];
	}
	cout << CalculateSubArray(arr, n, k);
	return 0;
}

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

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED