131572025-01-06 19:14:51fzs1969InverziĂłpython3Time limit exceeded 46/50504ms64624 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/014ms3128 KiB
2Accepted0/050ms8804 KiB
3Accepted1/116ms3124 KiB
4Accepted2/216ms3120 KiB
5Accepted7/716ms3312 KiB
6Accepted2/252ms8796 KiB
7Accepted2/2389ms64504 KiB
8Accepted2/2435ms64572 KiB
9Time limit exceeded0/2501ms64424 KiB
10Accepted2/2428ms64576 KiB
11Accepted2/2426ms64572 KiB
12Accepted2/2488ms60544 KiB
13Accepted2/2490ms64428 KiB
14Accepted2/2421ms64576 KiB
15Accepted2/2358ms64572 KiB
16Accepted2/2428ms64544 KiB
17Time limit exceeded0/2504ms64624 KiB
18Accepted2/2493ms64576 KiB
19Accepted3/3363ms64576 KiB
20Accepted3/3400ms64572 KiB
21Accepted2/2372ms64572 KiB
22Accepted2/2488ms64576 KiB
23Accepted2/2428ms64572 KiB
24Accepted2/2379ms64572 KiB