Small range - MarisaOJ: Marisa Online Judge

Given an integer array

$A$ of length

$n$ . Count the number of subarrays whose maximum and minimum values differ by no more than

$k$ . ### Input - The first line contains 2 integers

$n, k$ . - The second line contains

$n$ integers

$A_i$ . ### Output - Print the number of satisfied subarrays. ### Constraints -

$1 \le n, k \le 10^5$ . -

$1 \le k \le 10^9$ . -

$|A_i| \le 10^9$ . ### Example Input:

$4 1 1 3 1 2$

Output:

$5$

Topic

Two pointers

Rating

800

Solution (2)

Solution