~/algor $ cat masalalar/minmax-25-qoshnilar-yigindisi-eng-kattasi
Minmax-29
Qo'shni juftlarning eng katta yig'indisi
Oson
1000 ms
128 MB
32%
Natural son $N$ va $N$ ta butun son berilgan. Qo'shni ikki element yig'indilari $A_{i} + A_{i + 1}$ ($1 \le i \lt N$) orasidan eng kattasini va unga birinchi erishiladigan $i$ ni 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 ikkita butun son: eng katta yig'indi va birinchi bunday $i$.
Izoh
$2 \le N \le 1000$
$-10^{9} \le A_{i} \le 10^{9}$
Misollar
Kirish #1
6 3 8 2 9 1 5
Chiqish #1
11 1
Kirish #2
2 -4 -6
Chiqish #2
-10 1