Maximum Value
CodeChefOpen on judge ↗
Given an array of non-negative sorted integers $ARR$, and queries $Q$. Each query has two integers $L$ and $R$. You are also provided with a function F(X), such that: $F(X) = 10*X - (R - L)$ Where: $X$ = Number of elements in $ARR$ that are also in the range $[L, R]$. **For Example :**  => $ARR = [1, 2, 3, 4, 5]$  => $Q = 2$  => Query 1 => [1, 2],  => $X$ = 2 (element
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.
Sign in to chat with the tutor and save your progress.
Sign in to start