184402025-10-22 18:33:10algoproInverziópypy3Accepted 50/50159ms62732 KiB
# UUID: 22c5ee91-febf-4b8e-9c83-9fbf09166ad9
#!/usr/bin/env python3
# @check-accepted: *

from sys import stdin

input = stdin.readline

n = int(input())
s = [int(x) for x in input().split()]
indexek = [0]*(n+1)
for i in range(n):
    indexek[s[i]] = i
#print(s)
#print(indexek)

i= j= -1

legjobb = 0
for k in range(1,n+1):
    index = indexek[k]
    if index < legjobb:
        if legjobb - index > j - i:
            j = legjobb
            i = index
    legjobb = max(legjobb, index)        



if i == -1:
    print(-1)
else:
    print(i+1,j+1)
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/043ms19360 KiB
2Accepted0/057ms25548 KiB
3Accepted1/139ms19544 KiB
4Accepted2/248ms21112 KiB
5Accepted7/750ms21220 KiB
6Accepted2/257ms25576 KiB
7Accepted2/2136ms62708 KiB
8Accepted2/2159ms62708 KiB
9Accepted2/2158ms62708 KiB
10Accepted2/2136ms62660 KiB
11Accepted2/2158ms62708 KiB
12Accepted2/2153ms62196 KiB
13Accepted2/2136ms62708 KiB
14Accepted2/2134ms62708 KiB
15Accepted2/2153ms62680 KiB
16Accepted2/2158ms62732 KiB
17Accepted2/2136ms62704 KiB
18Accepted2/2134ms62704 KiB
19Accepted3/3152ms62708 KiB
20Accepted3/3155ms62516 KiB
21Accepted2/2134ms62712 KiB
22Accepted2/2136ms62544 KiB
23Accepted2/2155ms62684 KiB
24Accepted2/2128ms62708 KiB