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
№ | Пользователь | Рейтинг |
---|---|---|
1 | jiangly | 3846 |
2 | tourist | 3799 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3590 |
6 | Ormlis | 3533 |
7 | Benq | 3468 |
8 | Radewoosh | 3463 |
9 | ecnerwala | 3451 |
9 | Um_nik | 3451 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 165 |
2 | -is-this-fft- | 161 |
3 | Qingyu | 160 |
4 | Dominater069 | 158 |
5 | atcoder_official | 157 |
6 | adamant | 154 |
7 | Um_nik | 151 |
8 | djm03178 | 150 |
9 | luogu_official | 149 |
10 | awoo | 147 |
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. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
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) |
Название |
---|