~/algor $ cat masalalar/minmax-36-eng-foydali-savdo
Minmax-33
Eng foydali savdo
O'rtacha
1000 ms
128 MB
45%
$N$ kun davomida tovar narxlari $A_{1}, A_{2}, \ldots, A_{N}$ berilgan. Tovar $i$-kuni sotib olinib, undan keyinroq $j$-kuni ($i \lt j$) sotiladi; foyda:
$$A_{j} - A_{i}$$
Eng katta foydani toping. Sotib olish va sotish majburiy, shuning uchun foyda manfiy bo'lishi ham mumkin.
Kiruvchi ma'lumotlar
Birinchi qatorda natural son $N$. Keyingi qatorda $N$ ta butun son $A_{i}$.
Chiquvchi ma'lumotlar
Bitta butun son — eng katta foyda.
Izoh
$2 \le N \le 10^{5}$
$1 \le A_{i} \le 10^{9}$
Misollar
Kirish #1
6 7 2 5 1 6 3
Chiqish #1
5
Kirish #2
3 5 4 2
Chiqish #2
-1