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 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
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) |
Название |
---|