~/algor $ cat masalalar/minmax-28-prefiks-minimumlari
Minmax-31
Har bir qadamdagi minimum
Muallif:
Iqbolshoh Ilhomjonov
Oson
1000 ms
128 MB
33%
Natural son $N$ va $N$ ta butun son berilgan. Har bir $k$ ($1 \le k \le N$) uchun dastlabki $k$ ta element $A_{1}, A_{2}, \ldots, A_{k}$ ning eng kichigini toping.
Kiruvchi ma'lumotlar
Birinchi qatorda natural son $N$. Keyingi qatorda $N$ ta butun son $A_{i}$.
Chiquvchi ma'lumotlar
Bitta qatorda bo'sh joy bilan ajratilgan $N$ ta butun son: $k = 1, 2, \ldots, N$ uchun topilgan eng kichik sonlar.
Izoh
$1 \le N \le 1000$
$-10^{9} \le A_{i} \le 10^{9}$
Misollar
Kirish #1
6 5 7 3 4 1 2
Chiqish #1
5 5 3 3 1 1
Kirish #2
1 -8
Chiqish #2
-8