Given an array of size n.You need to select those two different indices such that quirk between them is maximum.Quirk Q(i,j)= 
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 154 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 146 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 133 |
| 10 | cry | 130 |
→ Find user
→ Recent actions
Got this question in OA yesterday,can anyone solve this
Revision en4, by ram396, 2024-03-03 19:36:35
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en4 |
|
ram396 | 2024-03-03 19:36:35 | 14 | Tiny change: 'is maximum\n=\n | |
| en2 |
|
ram396 | 2024-03-03 19:34:36 | 73 | Tiny change: 'aximum\n\n' -> 'aximum\n\n\n' | |
| en1 |
|
ram396 | 2024-03-03 19:29:14 | 170 | Initial revision (saved to drafts) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/09/2026 15:31:39 (g2).
Desktop version, switch to mobile version.
Supported by
