Stable Trading Windows

You are given n daily prices of an asset and an integer k. A trading window is a contiguous block of days [i, j] with i <= j. A window is stable if, inside it, the highest price minus the lowest price is at most k. Count how many stable windows exist. A single day is always a stable window. The answer can be very large and may exceed a 32-bit integer. Input format: - First line: n k - Second line: n integers (the prices) Print a single integer: the number of stable windows.

1 <= n <= 10^5
0 <= k <= 2*10^9
-10^9 <= price[i] <= 10^9

5 2
1 3 2 4 3

13

3 0
5 5 5

6