130622025-01-05 13:17:43fzs1969InverziĂłpython3Time limit exceeded 46/50514ms64632 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/017ms3124 KiB
2Accepted0/050ms8796 KiB
3Accepted1/116ms2960 KiB
4Accepted2/217ms3168 KiB
5Accepted7/717ms3068 KiB
6Accepted2/252ms8840 KiB
7Accepted2/2365ms64576 KiB
8Time limit exceeded0/2503ms64580 KiB
9Time limit exceeded0/2514ms64500 KiB
10Accepted2/2442ms64532 KiB
11Accepted2/2462ms64600 KiB
12Accepted2/2483ms60572 KiB
13Accepted2/2435ms64628 KiB
14Accepted2/2497ms64576 KiB
15Accepted2/2372ms64632 KiB
16Accepted2/2442ms64580 KiB
17Accepted2/2500ms64552 KiB
18Accepted2/2495ms64580 KiB
19Accepted3/3356ms64580 KiB
20Accepted3/3356ms64580 KiB
21Accepted2/2367ms64592 KiB
22Accepted2/2490ms64580 KiB
23Accepted2/2493ms64576 KiB
24Accepted2/2384ms64576 KiB