Help me. thanks.
Give a sequence of numbers a1,a2...an. (n<=2*10^5, 0<a[i]<=10^6). Find the maximum of (a[i] mod a[j]) a[i]>=a[j], (1<=i,j<=n).
For example
input
3 2 4 5
output 1 ( 5 mod 4)
intput
3 15 22 44
output
14 ( 44 mod 15 ).
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | cry | 158 |
4 | atcoder_official | 156 |
4 | nor | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 154 |
8 | adamant | 153 |
8 | Um_nik | 153 |
10 | djm03178 | 146 |
Help me. thanks.
Give a sequence of numbers a1,a2...an. (n<=2*10^5, 0<a[i]<=10^6). Find the maximum of (a[i] mod a[j]) a[i]>=a[j], (1<=i,j<=n).
For example
input
3 2 4 5
output 1 ( 5 mod 4)
intput
3 15 22 44
output
14 ( 44 mod 15 ).
Название |
---|
The problem is from codeforces, here
Read the editorial here