183442025-10-20 17:42:04algoproInverziópypy3Time limit exceeded 12/50606ms84432 KiB
# UUID: 7fac4217-53d4-42f1-a71f-b03234aa28c4
n = int(input())
arr = list(map(int, input().split()))

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

max_dist = -1
best_i = -1
best_j = -1

for i in range(n - 1):
    if arr[i] > min_right[i + 1]:
        j = n - 1
        while j > i and arr[j] >= arr[i]:
            j -= 1
        if j > i:
            dist = j - i
            if dist > max_dist:
                max_dist = dist
                best_i, best_j = i + 1, j + 1

if max_dist == -1:
    print(-1)
else:
    print(best_i, best_j)
SubtaskSumTestVerdictTimeMemory
base12/50
1Accepted0/043ms19376 KiB
2Time limit exceeded0/0578ms27352 KiB
3Accepted1/143ms19556 KiB
4Accepted2/248ms21416 KiB
5Accepted7/757ms21508 KiB
6Time limit exceeded0/2602ms27344 KiB
7Time limit exceeded0/2606ms84368 KiB
8Time limit exceeded0/2592ms84212 KiB
9Time limit exceeded0/2601ms84232 KiB
10Time limit exceeded0/2595ms84212 KiB
11Time limit exceeded0/2587ms84208 KiB
12Time limit exceeded0/2592ms79928 KiB
13Time limit exceeded0/2588ms84196 KiB
14Time limit exceeded0/2592ms84416 KiB
15Time limit exceeded0/2589ms84432 KiB
16Time limit exceeded0/2592ms84212 KiB
17Time limit exceeded0/2595ms84416 KiB
18Time limit exceeded0/2591ms84212 KiB
19Time limit exceeded0/3597ms84352 KiB
20Time limit exceeded0/3583ms84212 KiB
21Time limit exceeded0/2591ms84212 KiB
22Time limit exceeded0/2596ms84420 KiB
23Time limit exceeded0/2597ms84204 KiB
24Accepted2/2155ms84212 KiB