Qtiyapa
CodeChefOpen on judge ↗
Given two non-increasing array of integers A,B i.e A[i] >= A[i+1] and B[i] >= B[i+1] and for all i, 0 ≤ i The qtiyapa of two numbers is given by: Q (A[i],B[j]) = j - i , if j >=i and B[j] >= A[i], or 0 otherwise. Find the qtiyapa of the two arrays, that is given by: Q (A,B)= max (Q(A[i],B[j])) for 0≤ i, j Input The first line contains an integer, tc, denoting the number of test cases. The next
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