130612025-01-05 13:14:54fzs1969InverziĂłpython3Time limit exceeded 46/50527ms64620 KiB
db = int(input())
t = list(map(int,input().split()))
h = [0] * db
for i in range(db):
     h[t[i]-1] = i

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]+1, elemek[1]+1)
else:
    print(-1)
SubtaskSumTestVerdictTimeMemory
base46/50
1Accepted0/016ms3128 KiB
2Accepted0/050ms8800 KiB
3Accepted1/116ms3320 KiB
4Accepted2/217ms3124 KiB
5Accepted7/717ms3128 KiB
6Accepted2/252ms8780 KiB
7Accepted2/2397ms64576 KiB
8Accepted2/2437ms64620 KiB
9Time limit exceeded0/2527ms64524 KiB
10Accepted2/2439ms64436 KiB
11Time limit exceeded0/2509ms64576 KiB
12Accepted2/2425ms60492 KiB
13Accepted2/2433ms64576 KiB
14Accepted2/2497ms64580 KiB
15Accepted2/2395ms64576 KiB
16Accepted2/2444ms64476 KiB
17Accepted2/2497ms64596 KiB
18Accepted2/2481ms64580 KiB
19Accepted3/3381ms64576 KiB
20Accepted3/3377ms64576 KiB
21Accepted2/2391ms64580 KiB
22Accepted2/2488ms64576 KiB
23Accepted2/2444ms64580 KiB
24Accepted2/2381ms64576 KiB