Codeforces and Polygon may be unavailable from December 6, 19:00 (UTC) to December 6, 21:00 (UTC) due to technical maintenance. ×

Got this question in OA yesterday,can anyone solve this

Revision en1, by ram396, 2024-03-03 19:29:14

Given an array of size n.You need to select those two different indices such that quirk between them is maximum

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English ram396 2024-03-03 19:36:35 14 Tiny change: 'is maximum\n![ ](/pr' -> 'is maximum.Quirk Q(i,j)=\n![ ](/pr'
en3 English ram396 2024-03-03 19:35:00 0 (published)
en2 English ram396 2024-03-03 19:34:36 73 Tiny change: 'aximum\n\n' -> 'aximum\n\n\n'
en1 English ram396 2024-03-03 19:29:14 170 Initial revision (saved to drafts)