Continuous Subarrays

CodeChefRating 2760Open on judge ↗

An array $B$ of length $M$ is said to be *good*, if and only if for every $i$ such that $1 \le i \lt M$, $|B_i - B_{i + 1}| \le M$ holds. That is, the absolute difference between any $2$ adjacent elements does not exceed the length of the array. Given an array $A$ of length $N$, count the number of its subarrays that are *good*. Formally, count the number of pairs $(L, R)$ ($1 \le L \le R \le

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI