Alitaulukot

import java.util.List;
import java.util.ArrayList;
import java.util.Scanner;

public class Alitaulukot {
    
    private static final Scanner scanner = new Scanner(System.in);

    public static void main(String[] args) {
        String input1 = scanner.nextLine();
        String input2 = scanner.nextLine();

        String[] input1List = input1.split(" ");
        int listSize = Integer.valueOf(input1List[0]);
        int maxDifference = Integer.valueOf(input1List[1]);

        String[] input2List = input2.split(" ");
        int[] givenNumberList = new int[listSize];
        for(int i = 0; i < givenNumberList.length; i++) {
            givenNumberList[i] = Integer.valueOf(input2List[i]);
        }

        int solutions = givenNumberList.length;
/*
        List<Integer> previousInts = new ArrayList<Integer>();

        for(int number : givenNumberList) {
            for(int i = previousInts.size()-1; i >= 0; i--) {
                int previousNumber = previousInts.get(i);
                if(Math.abs(previousNumber-number) <= maxDifference) {
                    solutions++;
                }
                else {
                    previousInts = previousInts.subList(i+1, previousInts.size());
                    break;
                }
            }
            previousInts.add(Integer.valueOf(number));
        }
*/        

        int previousListStartDistance = 0;

        for(int i = 0; i < givenNumberList.length; i++) {
            int currentNumber = givenNumberList[i];
//            System.out.println("\ni = "+i);
//            System.out.println("d = "+previousListStartDistance);

            for(int numberIndex = i-1; numberIndex >= i-previousListStartDistance; numberIndex--) {
                int previousNumber = givenNumberList[numberIndex];
//                System.out.println("ni = "+numberIndex);
                if(Math.abs(previousNumber-currentNumber) <= maxDifference) {
                    solutions++;
                }
                else {
//                    System.out.println("BREAK");
                    previousListStartDistance = i-numberIndex-1;
                    break;
                }
            }
            previousListStartDistance++;
        }

        System.out.println(solutions);
    }
}

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