130602025-01-05 13:07:42fzs1969InverziĂłpython3Time limit exceeded 40/50550ms64664 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]
    if maximum < h[i]:
        maximum = h[i]

if maxtáv > 0:
    print(elemek[0], elemek[1])
else:
    print(-1)
SubtaskSumTestVerdictTimeMemory
base40/50
1Accepted0/017ms2964 KiB
2Accepted0/056ms8788 KiB
3Accepted1/116ms3116 KiB
4Accepted2/217ms3128 KiB
5Accepted7/717ms3264 KiB
6Accepted2/256ms8884 KiB
7Accepted2/2389ms64572 KiB
8Time limit exceeded0/2526ms64472 KiB
9Time limit exceeded0/2550ms64664 KiB
10Accepted2/2446ms64648 KiB
11Accepted2/2444ms64580 KiB
12Accepted2/2500ms60548 KiB
13Accepted2/2465ms64580 KiB
14Time limit exceeded0/2526ms64580 KiB
15Accepted2/2391ms64576 KiB
16Time limit exceeded0/2517ms64576 KiB
17Accepted2/2444ms64576 KiB
18Time limit exceeded0/2513ms64612 KiB
19Accepted3/3388ms64576 KiB
20Accepted3/3409ms64576 KiB
21Accepted2/2421ms64560 KiB
22Accepted2/2451ms64632 KiB
23Accepted2/2483ms64576 KiB
24Accepted2/2402ms64580 KiB