130462025-01-05 11:59:22fzs1969InverziĂłpython3Time limit exceeded 14/50595ms61456 KiB
db = int(input())
t = input().split()
h = [0] * db
for i in range(db):
     h[int(t[i])-1] = i+1

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

if maxtáv > 0:
    print(elemek[0], elemek[1])
else:
    print(-1)
SubtaskSumTestVerdictTimeMemory
base14/50
1Accepted0/016ms3116 KiB
2Accepted0/067ms8804 KiB
3Accepted1/116ms3128 KiB
4Accepted2/217ms3224 KiB
5Accepted7/717ms3188 KiB
6Accepted2/272ms8872 KiB
7Time limit exceeded0/2532ms61352 KiB
8Time limit exceeded0/2588ms61260 KiB
9Time limit exceeded0/2592ms61324 KiB
10Time limit exceeded0/2580ms61256 KiB
11Time limit exceeded0/2588ms61260 KiB
12Time limit exceeded0/2586ms59132 KiB
13Time limit exceeded0/2563ms61300 KiB
14Time limit exceeded0/2569ms61264 KiB
15Time limit exceeded0/2549ms61264 KiB
16Time limit exceeded0/2593ms61428 KiB
17Time limit exceeded0/2570ms61316 KiB
18Time limit exceeded0/2568ms61260 KiB
19Time limit exceeded0/3546ms61264 KiB
20Time limit exceeded0/3510ms61376 KiB
21Time limit exceeded0/2552ms61256 KiB
22Time limit exceeded0/2577ms61256 KiB
23Time limit exceeded0/2595ms61260 KiB
24Accepted2/2486ms61456 KiB