Given an array of size n.You need to select those two different indices such that quirk between them is maximum 
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
→ Find user
→ Recent actions
Got this question in OA yesterday,can anyone solve this
Revision en3, by ram396, 2024-03-03 19:35:00
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-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/09/2024 04:47:14 (k3).
Desktop version, switch to mobile version.
Supported by
