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 ).
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 149 |
6 | -is-this-fft- | 148 |
6 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | cry | 144 |
ALGORITHM
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 ).
Name |
---|