144532025-01-10 20:24:38radocziaronInverziópython3Time limit exceeded 9/50601ms61404 KiB
n = int(input())
lista = list(map(int, input().split()))
max1 = -1
k = []

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

print(k[0],k[1])
SubtaskSumTestVerdictTimeMemory
base9/50
1Accepted0/016ms2868 KiB
2Time limit exceeded0/0587ms8796 KiB
3Runtime error0/116ms2868 KiB
4Accepted2/217ms3124 KiB
5Accepted7/752ms3124 KiB
6Time limit exceeded0/2600ms8884 KiB
7Time limit exceeded0/2601ms61272 KiB
8Time limit exceeded0/2579ms61252 KiB
9Time limit exceeded0/2588ms61260 KiB
10Time limit exceeded0/2592ms61404 KiB
11Time limit exceeded0/2593ms61260 KiB
12Time limit exceeded0/2587ms59460 KiB
13Time limit exceeded0/2591ms61336 KiB
14Time limit exceeded0/2591ms61236 KiB
15Time limit exceeded0/2592ms61264 KiB
16Time limit exceeded0/2589ms61256 KiB
17Time limit exceeded0/2583ms61256 KiB
18Time limit exceeded0/2588ms61260 KiB
19Time limit exceeded0/3588ms61260 KiB
20Time limit exceeded0/3588ms61260 KiB
21Time limit exceeded0/2586ms61256 KiB
22Time limit exceeded0/2591ms61372 KiB
23Time limit exceeded0/2591ms61332 KiB
24Time limit exceeded0/2584ms61256 KiB