131602025-01-06 19:18:55fzs1969InverziĂłpython3Time limit exceeded 46/50518ms64620 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/016ms3288 KiB
2Accepted0/048ms8796 KiB
3Accepted1/116ms3120 KiB
4Accepted2/217ms3116 KiB
5Accepted7/717ms3240 KiB
6Accepted2/254ms8856 KiB
7Accepted2/2370ms64620 KiB
8Time limit exceeded0/2507ms64420 KiB
9Accepted2/2439ms64460 KiB
10Accepted2/2497ms64572 KiB
11Accepted2/2426ms64500 KiB
12Accepted2/2493ms60540 KiB
13Accepted2/2428ms64572 KiB
14Accepted2/2497ms64572 KiB
15Accepted2/2365ms64572 KiB
16Accepted2/2433ms64572 KiB
17Accepted2/2493ms64576 KiB
18Time limit exceeded0/2518ms64428 KiB
19Accepted3/3377ms64576 KiB
20Accepted3/3358ms64572 KiB
21Accepted2/2389ms64572 KiB
22Accepted2/2481ms64576 KiB
23Accepted2/2446ms64576 KiB
24Accepted2/2377ms64572 KiB