183362025-10-20 16:57:11algoproInverziópypy3Accepted 50/50157ms62716 KiB
# UUID: 46761ddc-f929-408a-af9a-8e777287c6b0
import sys
input = sys.stdin.readline

def solve():
    n = int(input())
    a = [int(x) for x in input().split()]
    h = [0] * (n)
    for i in range(n): h[a[i]-1] = i
    f, s = -1, -1
    cnt = -1
    for i in range(n):
        if h[i] < cnt and cnt - h[i] > s - f:
            f = h[i]
            s = cnt
        cnt = max(cnt, h[i])
    if f == -1 : print(f)
    else: print(f+1, s+1)


solve()
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/039ms19444 KiB
2Accepted0/064ms25324 KiB
3Accepted1/143ms19424 KiB
4Accepted2/243ms21208 KiB
5Accepted7/743ms21032 KiB
6Accepted2/254ms25320 KiB
7Accepted2/2152ms62540 KiB
8Accepted2/2157ms62564 KiB
9Accepted2/2136ms62684 KiB
10Accepted2/2136ms62708 KiB
11Accepted2/2150ms62712 KiB
12Accepted2/2155ms62260 KiB
13Accepted2/2156ms62716 KiB
14Accepted2/2133ms62660 KiB
15Accepted2/2131ms62708 KiB
16Accepted2/2156ms62508 KiB
17Accepted2/2152ms62680 KiB
18Accepted2/2135ms62492 KiB
19Accepted3/3131ms62708 KiB
20Accepted3/3129ms62704 KiB
21Accepted2/2150ms62640 KiB
22Accepted2/2153ms62616 KiB
23Accepted2/2151ms62704 KiB
24Accepted2/2128ms62700 KiB