144542025-01-10 20:32:26radocziaronInverziópython3Time limit exceeded 2/50601ms64640 KiB
n = int(input())
lista = list(map(int, input().split()))
max1 = []
k = []

for i in range(n-1):
    for j in range(n-1,i,-1):
        if lista[i] > lista[j]:
            max1 += [j-i]
            k += [i+1,j+1]
            break  

m = max(max1)
l = max1.index(m)

print(k[l],k[l+1])
SubtaskSumTestVerdictTimeMemory
base2/50
1Accepted0/016ms3112 KiB
2Time limit exceeded0/0583ms8796 KiB
3Runtime error0/116ms3088 KiB
4Accepted2/217ms3112 KiB
5Wrong answer0/754ms3020 KiB
6Time limit exceeded0/2601ms8756 KiB
7Time limit exceeded0/2601ms64636 KiB
8Time limit exceeded0/2587ms64444 KiB
9Time limit exceeded0/2591ms64556 KiB
10Time limit exceeded0/2587ms64572 KiB
11Time limit exceeded0/2587ms64536 KiB
12Time limit exceeded0/2584ms60368 KiB
13Time limit exceeded0/2589ms64560 KiB
14Time limit exceeded0/2587ms64572 KiB
15Time limit exceeded0/2587ms64616 KiB
16Time limit exceeded0/2589ms64572 KiB
17Time limit exceeded0/2586ms64580 KiB
18Time limit exceeded0/2591ms64444 KiB
19Time limit exceeded0/3591ms64576 KiB
20Time limit exceeded0/3587ms64572 KiB
21Time limit exceeded0/2579ms64576 KiB
22Time limit exceeded0/2586ms64572 KiB
23Time limit exceeded0/2584ms64640 KiB
24Time limit exceeded0/2582ms64572 KiB