183372025-10-20 17:17:21algoproInverziópypy3Time limit exceeded 12/50606ms84400 KiB
# UUID: 81d2e358-f917-4dbf-a746-499673c03c1f
n = int(input())
arr = list(map(int, input().split()))

min_jobb = [0] * n
min_jobb[-1] = arr[-1]

for i in range(n - 2, -1, -1):
    min_jobb[i] = min(arr[i], min_jobb[i + 1])

max_hossz = -1
legjobb_i = -1
legjobb_j = -1

for i in range(n - 1):
    if arr[i] > min_jobb[i + 1]:
        j = n - 1
        while j > i and arr[j] >= arr[i]:
            j -= 1
        if j > i:
            hossz = j - i
            if hossz > max_hossz:
                max_hossz = hossz
                legjobb_i, legjobb_j = i + 1, j + 1

if max_hossz == -1:
    print(-1)
else:
    print(legjobb_i, legjobb_j)
SubtaskSumTestVerdictTimeMemory
base12/50
1Accepted0/039ms19604 KiB
2Time limit exceeded0/0584ms27288 KiB
3Accepted1/143ms19352 KiB
4Accepted2/248ms21416 KiB
5Accepted7/754ms21476 KiB
6Time limit exceeded0/2602ms27296 KiB
7Time limit exceeded0/2606ms84388 KiB
8Time limit exceeded0/2595ms84212 KiB
9Time limit exceeded0/2592ms84212 KiB
10Time limit exceeded0/2587ms84208 KiB
11Time limit exceeded0/2606ms84212 KiB
12Time limit exceeded0/2589ms79932 KiB
13Time limit exceeded0/2597ms84212 KiB
14Time limit exceeded0/2596ms84212 KiB
15Time limit exceeded0/2606ms84280 KiB
16Time limit exceeded0/2597ms84212 KiB
17Time limit exceeded0/2597ms84212 KiB
18Time limit exceeded0/2589ms84300 KiB
19Time limit exceeded0/3606ms84212 KiB
20Time limit exceeded0/3595ms84212 KiB
21Time limit exceeded0/2582ms84400 KiB
22Time limit exceeded0/2578ms84212 KiB
23Time limit exceeded0/2606ms84176 KiB
24Accepted2/2182ms84164 KiB