165382025-05-06 13:37:22algoproLegcsalódottabb versenyző (75 pont)pypy3Accepted 75/7576ms32000 KiB
# UUID: 2de06806-23e8-4d1f-966a-0b51c55331c3
N=int(input())
A=[int(x) for x in input().split()]

length = 0
lindex = -2
maxindex = 0
for i in range(1,N):
    if A[i]>A[maxindex]:
        if i-maxindex>length:
            length=i-maxindex
            lindex=maxindex
        maxindex = i
    else:
        if i-maxindex>length:
            length=i-maxindex

print(lindex+1)
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/043ms19384 KiB
2Accepted0/075ms32000 KiB
3Accepted5/539ms19400 KiB
4Accepted5/539ms19400 KiB
5Accepted5/543ms19316 KiB
6Accepted5/539ms19416 KiB
7Accepted5/539ms19360 KiB
8Accepted5/539ms19608 KiB
9Accepted5/539ms19568 KiB
10Accepted5/545ms19688 KiB
11Accepted5/539ms19816 KiB
12Accepted5/548ms19968 KiB
13Accepted5/575ms32000 KiB
14Accepted5/576ms32000 KiB
15Accepted5/568ms32000 KiB
16Accepted5/567ms32000 KiB
17Accepted5/575ms32000 KiB