130642025-01-05 13:23:48fzs1969InverziĂłpython3Time limit exceeded 44/50518ms64712 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
base44/50
1Accepted0/016ms3128 KiB
2Accepted0/046ms8800 KiB
3Accepted1/116ms3148 KiB
4Accepted2/217ms3088 KiB
5Accepted7/717ms3124 KiB
6Accepted2/254ms8796 KiB
7Accepted2/2370ms64576 KiB
8Accepted2/2463ms64504 KiB
9Time limit exceeded0/2518ms64480 KiB
10Accepted2/2485ms64576 KiB
11Accepted2/2425ms64580 KiB
12Accepted2/2483ms60552 KiB
13Time limit exceeded0/2513ms64536 KiB
14Accepted2/2435ms64580 KiB
15Accepted2/2351ms64580 KiB
16Accepted2/2490ms64612 KiB
17Accepted2/2430ms64436 KiB
18Accepted2/2490ms64580 KiB
19Accepted3/3358ms64576 KiB
20Accepted3/3382ms64576 KiB
21Accepted2/2352ms64580 KiB
22Time limit exceeded0/2505ms64576 KiB
23Accepted2/2495ms64580 KiB
24Accepted2/2368ms64712 KiB