130592025-01-05 13:04:55fzs1969InverziĂłpython3Time limit exceeded 12/50583ms61440 KiB
db = int(input())
t = list(map(int,input().split()))
h = [0] * db
for i in range(db):
     h[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
base12/50
1Accepted0/018ms3120 KiB
2Accepted0/070ms8952 KiB
3Accepted1/119ms3124 KiB
4Accepted2/220ms3224 KiB
5Accepted7/717ms3224 KiB
6Accepted2/272ms8956 KiB
7Time limit exceeded0/2532ms61232 KiB
8Time limit exceeded0/2546ms61432 KiB
9Time limit exceeded0/2510ms61376 KiB
10Time limit exceeded0/2531ms61244 KiB
11Time limit exceeded0/2541ms61428 KiB
12Time limit exceeded0/2533ms60088 KiB
13Time limit exceeded0/2540ms61296 KiB
14Time limit exceeded0/2540ms61224 KiB
15Time limit exceeded0/2509ms61240 KiB
16Time limit exceeded0/2536ms61244 KiB
17Time limit exceeded0/2583ms61328 KiB
18Time limit exceeded0/2537ms61380 KiB
19Time limit exceeded0/3542ms61300 KiB
20Time limit exceeded0/3509ms61236 KiB
21Time limit exceeded0/2501ms61440 KiB
22Time limit exceeded0/2569ms61220 KiB
23Time limit exceeded0/2513ms61440 KiB
24Time limit exceeded0/2508ms61324 KiB