← All problemsSign in

Unstable Subarray

CodeChefRating 1545Open on judge ↗

You are given an array $A$ of size $N$. We define the function $f(l, r) = \sum_{i=l}^{r-1}(A_i-A_{i+1})$, where $1\le l \le r \le N$. Note that $f(i, i)$ is defined as $0$. A subarray $A[l, r]$ is considered *unstable* if $f(l,r) \neq (A_r-A_l)$. Count the number of *unstable* subarrays in the array. Note that the subarray $A[l, r]$ consists of $A_l, A_{(l+1)}, \ldots, A_{(r-1)}, A_r$. ##

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

Sign in to chat with the tutor and save your progress.

Sign in to start