130632025-01-05 13:21:34fzs1969InverziĂłpython3Time limit exceeded 46/50509ms64756 KiB
db = int(input())
t = list(map(int,input().split()))
méret = db + 1
h = [0] * méret
for i in range(db):
     h[t[i]] = i

maximum = h[0]
maxtáv = 0
for i in range(1,méret):
    if maxtáv < maximum-h[i]:
        maxtáv = maximum-h[i]
        elemek = [h[i], maximum]
    if maximum < h[i]:
        maximum = h[i]

if maxtáv > 0:
    print(elemek[0]+1, elemek[1]+1)
else:
    print(-1)
SubtaskSumTestVerdictTimeMemory
base46/50
1Accepted0/016ms3116 KiB
2Accepted0/048ms8788 KiB
3Accepted1/116ms3132 KiB
4Accepted2/217ms3128 KiB
5Accepted7/717ms3128 KiB
6Accepted2/250ms8800 KiB
7Accepted2/2412ms64580 KiB
8Accepted2/2465ms64756 KiB
9Time limit exceeded0/2509ms64564 KiB
10Accepted2/2444ms64576 KiB
11Accepted2/2432ms64576 KiB
12Accepted2/2421ms60476 KiB
13Time limit exceeded0/2503ms64580 KiB
14Accepted2/2495ms64656 KiB
15Accepted2/2356ms64580 KiB
16Accepted2/2418ms64580 KiB
17Accepted2/2493ms64580 KiB
18Accepted2/2451ms64576 KiB
19Accepted3/3400ms64580 KiB
20Accepted3/3375ms64576 KiB
21Accepted2/2384ms64580 KiB
22Accepted2/2444ms64576 KiB
23Accepted2/2483ms64580 KiB
24Accepted2/2400ms64576 KiB