Alitaulukot

#include <iostream>
#include <sstream>
#include <string>
#include <cmath>
#include <vector>
#include <stdio.h>     
#include <stdlib.h> 
#include <algorithm>
#define lint long long int

using namespace std;

lint length(lint x)
{
	return x * (x + 1) / 2;
}

lint range(lint x, lint y, bool findSmallest, lint arr[])
{
	vector<int> values;
	int a = 0;
	for(int i = x; i <= y; i++)
	{
		values.push_back(arr[i]);
	}
	if(findSmallest)
	{
		a = *min_element(values.begin(), values.end());
	}
	else
	{
		a = *max_element(values.begin(), values.end());
	}
	
	for(int i = x; i <= y; i++)
	{
		if(arr[i] == a)
		{
			a = i;
			break;
		}
	}
	return a;
}

lint CalculateSubArray(lint arr[], lint n, lint k)
{
	lint len = 0;
	lint result = 0;
	lint duplicate_len = 0;
	
	lint max = arr[0];
	lint min = arr[0];
	
	lint max_index = 0;
	lint min_index = 0;
	
	lint second_max_index = arr[1];
	lint second_min_index = arr[1];
	
	lint breaker_index = 0;
	
	bool barrier_number = false;
	
	//An adventurer will always progress or get to the same point.
	for(int i = 0; i < n; i++)
	{
		bool MaxChange = max < arr[i];
		bool MinChange = min > arr[i];
		
		bool Second_MaxChange = arr[second_max_index] > arr[i];
		bool Second_MinChange = arr[second_min_index] > arr[i];
		
		if(MaxChange) {
			max = arr[i];
			max_index = i;
		}
		else if(MinChange) {
			min = arr[i];
			min_index = i;
		}
		else if(Second_MaxChange) {
			second_max_index = i;
		}
		else if(Second_MinChange) {
			second_min_index = i;
		}
		
		
		if(max - min <= k) {
			len++;
		}
		else
		{
			result += length(len);
			len = 1;
			if(!barrier_number)
			{
				if(MaxChange) {
					breaker_index = min_index;
					
					lint x = range(breaker_index + 1, i-1, true, arr);
					
					min_index = x;
					min = arr[x];
					
					
				}
				else {
					breaker_index = max_index;
					
					lint x = range(breaker_index + 1, i-1, false, arr);
					
					max_index = x;
					max = arr[x];
					
					
				}
				len = i - breaker_index;
				duplicate_len = len-1;
			}
			else
			{
				max = arr[i];
				max_index = i;
				min = arr[i];
				min_index = i;
				
				second_max_index = i + 1;
				second_min_index = i + 1;
			}
			result -= length(duplicate_len);
			duplicate_len = 0;
		}	
		barrier_number = abs(arr[i] - arr[i + 1]) > k;
	}
	result += length(len);
	result -= length(duplicate_len);
	return result;
}

int main()
{
	lint n;
	cin >> n;
	lint k;
	cin >> k;
	lint arr[n+1];
	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: WRONG ANSWER

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 5

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 6

Group: 2, 3

Verdict: ACCEPTED

Test 7

Group: 2, 3

Verdict: RUNTIME ERROR

Test 8

Group: 2, 3

Verdict: ACCEPTED

Test 9

Group: 2, 3

Verdict: RUNTIME ERROR

Test 10

Group: 2, 3

Verdict: RUNTIME ERROR

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: RUNTIME ERROR

Test 13

Group: 3

Verdict: RUNTIME ERROR

Test 14

Group: 3

Verdict: RUNTIME ERROR

Test 15

Group: 3

Verdict: RUNTIME ERROR

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED