183342025-10-20 15:45:26algoproInverziópypy3Accepted 50/50212ms88308 KiB
# UUID: 5e8e6bfe-6fa7-4bf5-8a6d-db0564329e2a
import sys
input = sys.stdin.readline

def solv():
    N = int(input())
    B=tuple(map(int,input().split()))
    A=[0]*(N+1)
    #A=[(B[i],i) for i in range(N)]
    #A.sort()
    for i in range(N):
        A[B[i]]=i
    a=b=0
    leghatso=0
    for i in range(N):
        #cur,index=A[i]
        index=A[i+1]
        if index < leghatso:
            if leghatso-index>b-a:
                b=leghatso
                a=index
        leghatso=max(leghatso,index)

    if a==b:
        print(-1)
    else:
        print(a+1,b+1) 

solv()
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/039ms19608 KiB
2Accepted0/059ms27624 KiB
3Accepted1/143ms19416 KiB
4Accepted2/246ms21192 KiB
5Accepted7/748ms21260 KiB
6Accepted2/265ms27540 KiB
7Accepted2/2178ms88184 KiB
8Accepted2/2180ms88236 KiB
9Accepted2/2211ms88300 KiB
10Accepted2/2211ms88148 KiB
11Accepted2/2207ms88308 KiB
12Accepted2/2174ms87876 KiB
13Accepted2/2196ms88188 KiB
14Accepted2/2177ms88224 KiB
15Accepted2/2175ms88132 KiB
16Accepted2/2212ms88308 KiB
17Accepted2/2207ms88308 KiB
18Accepted2/2175ms88284 KiB
19Accepted3/3172ms88308 KiB
20Accepted3/3206ms88304 KiB
21Accepted2/2174ms88308 KiB
22Accepted2/2208ms88304 KiB
23Accepted2/2175ms88144 KiB
24Accepted2/2193ms88308 KiB