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 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | maspy | 150 |
| 3 | Um_nik | 145 |
| 4 | Errichto | 139 |
| 5 | adamant | 136 |
| 6 | maroonrk | 134 |
| 7 | nik_exists | 133 |
| 7 | DNR | 133 |
| 9 | AmShZ | 130 |
| 10 | Dominater069 | 129 |
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 |
|---|


