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)=
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 148 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
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.Quirk Q(i,j)=
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 |
---|