99422024-03-20 22:34:5842Legcsalódottabb versenyző (75 pont)python3Wrong answer 5/7518ms13508 KiB
# O(N)

from sys import stdin
input=stdin.readline

def solv():
    print(-1)
    return
    N = int(input())
    P = [int(x) for x in input().split()]
    maxl=1
    resindex=0
    curl=1
    curindex=0
    for i in range(1,N):
        if P[i] > P[curindex]:
            if maxl<curl:
                resindex=curindex
                maxl=curl
            curindex=i
            curl=1
        else:
            curl+=1
    if maxl==N:
        print(-1)
    else:
        print(resindex+1)
    
solv()
SubtaskSumTestVerdictTimeMemory
base5/75
1Wrong answer0/017ms10784 KiB
2Wrong answer0/017ms11296 KiB
3Accepted5/517ms11404 KiB
4Wrong answer0/517ms11280 KiB
5Wrong answer0/518ms11440 KiB
6Wrong answer0/517ms11460 KiB
7Wrong answer0/517ms11912 KiB
8Wrong answer0/517ms11688 KiB
9Wrong answer0/517ms12156 KiB
10Wrong answer0/518ms12304 KiB
11Wrong answer0/517ms12184 KiB
12Wrong answer0/517ms12396 KiB
13Wrong answer0/517ms12384 KiB
14Wrong answer0/518ms12364 KiB
15Wrong answer0/518ms12768 KiB
16Wrong answer0/518ms13096 KiB
17Wrong answer0/517ms13508 KiB