There are 4 arrays of A, B, C, D of size N, we have to find
max( |A[i]-A[j|) + |B[i]-B[j]| + |C[i]-C[j]| + D[i]-D[j] + |i-j|) where 1<=i<j<=n ; 1<N<=10^5
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 159 |
5 | atcoder_official | 156 |
6 | djm03178 | 153 |
6 | adamant | 153 |
8 | luogu_official | 149 |
9 | awoo | 148 |
10 | TheScrasse | 146 |
Help please
There are 4 arrays of A, B, C, D of size N, we have to find
max( |A[i]-A[j|) + |B[i]-B[j]| + |C[i]-C[j]| + D[i]-D[j] + |i-j|) where 1<=i<j<=n ; 1<N<=10^5
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en5 |
![]() |
liveoverflow | 2020-05-31 10:33:44 | 37 | Tiny change: 'o find \n max( | A[i' -> 'o find \nmax( | A[i' | |
en4 |
![]() |
liveoverflow | 2020-05-31 10:08:53 | 12 | Tiny change: 'e input : \n5 \n5 ' -> 'e input : \n5 \n5 ' | |
en3 |
![]() |
liveoverflow | 2020-05-31 10:05:16 | 94 | ||
en2 |
![]() |
liveoverflow | 2020-05-31 09:55:54 | 16 | ||
en1 |
![]() |
liveoverflow | 2020-05-31 09:54:52 | 170 | Initial revision (published) |
Name |
---|