~/algor $ cat masalalar/minmax-33-bittasiz-eng-kichik-oraliq
Minmax-36
Bittasiz eng kichik oraliq
Muallif:
Iqbolshoh Ilhomjonov
O'rtacha
1000 ms
128 MB
54%
Natural son $N$ va $N$ ta butun son berilgan. Ketma-ketlikdan aynan bitta elementni o'chirish kerak, shunda qolgan elementlarning eng kattasi va eng kichigi ayirmasi imkon qadar kichik bo'lsin. Shu eng kichik ayirmani toping.
Kiruvchi ma'lumotlar
Birinchi qatorda natural son $N$. Keyingi qatorda $N$ ta butun son $A_{i}$.
Chiquvchi ma'lumotlar
Bitta butun son.
Izoh
$2 \le N \le 10^{5}$
$-10^{9} \le A_{i} \le 10^{9}$
Misollar
Kirish #1
5 2 9 5 7 6
Chiqish #1
4
Kirish #2
2 -3 10
Chiqish #2
0