Given an array of size n.You need to select those two different indices such that quirk between them is maximum
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 164 |
2 | Um_nik | 163 |
3 | atcoder_official | 158 |
3 | cry | 158 |
3 | -is-this-fft- | 158 |
6 | awoo | 155 |
7 | adamant | 154 |
7 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
Got this question in OA yesterday,can anyone solve this
Given an array of size n.You need to select those two different indices such that quirk between them is maximum
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en4 | ram396 | 2024-03-03 19:36:35 | 14 | Tiny change: 'is maximum\n![ ](/pr' -> 'is maximum.Quirk Q(i,j)=\n![ ](/pr' | ||
en3 | ram396 | 2024-03-03 19:35:00 | 0 | (published) | ||
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) |
Name |
---|