Absolute Min Max

CodeChefRating 2521Open on judge ↗

Chef is given a sequence of integers $A_1, A_2, \ldots, A_N$. Chef considers a contiguous subsequence $A_l, A_{l+1}, \ldots, A_r$ (where $1 \le l \le r \le N$) *fruitful* if it satisfies the condition $$|A_l - A_r| = \mathrm{max}(A_l, A_{l+1}, \ldots, A_r) - \mathrm{min}(A_l, A_{l+1}, \ldots, A_r) \,.$$ Please help Chef find the number of fruitful contiguous subsequences of the sequence $A$

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