MAX ME

CodeChefOpen on judge ↗

Chef has provided you with a list $X$ of $N$ numbers and a constraint. Your task is to find the maximum value of the following constraint: $Abs(X_j-X_i ) + Abs(j-i)$ where $0 \leq i,$ $j < N$ and $X_i$ and $X_j$ are array elements $Abs$: Absolute value *** ###Input Format - The first line of input contains an integer $T$ denoting the number of test cases. Each test case contains tw

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