180672025-09-26 10:56:50birozsVölgy (100 pont)python3Wrong answer 35/100289ms7084 KiB
N = int(input())
T = []
for i in range(N):
    T.append(int(input()))
if N >= 3:
    maxszel = 0
    for i in range(N-2):
        for j in range(i+2,N):
            if max(T[i+1:j]) < min(T[i],T[j]):
                if j-i > maxszel:
                    maxszel = j-i
                    #print(T[i:j+1])
            if T[i] <= T[j]:
                break
    print(maxszel)
else:
    print(-1)
SubtaskSumTestVerdictTimeMemory
base35/100
1Accepted0/016ms3124 KiB
2Accepted0/032ms3124 KiB
3Accepted5/516ms3124 KiB
4Accepted5/516ms2984 KiB
5Accepted5/516ms2992 KiB
6Accepted5/516ms3004 KiB
7Wrong answer0/516ms3124 KiB
8Accepted5/516ms3124 KiB
9Time limit exceeded0/5284ms3120 KiB
10Accepted5/532ms3012 KiB
11Time limit exceeded0/5202ms3288 KiB
12Accepted5/561ms3216 KiB
13Time limit exceeded0/5280ms3380 KiB
14Time limit exceeded0/5280ms3336 KiB
15Time limit exceeded0/5279ms7084 KiB
16Time limit exceeded0/5282ms6916 KiB
17Time limit exceeded0/5289ms6916 KiB
18Time limit exceeded0/5280ms6916 KiB
19Time limit exceeded0/5284ms6916 KiB
20Time limit exceeded0/5289ms6916 KiB
21Time limit exceeded0/5289ms6920 KiB
22Time limit exceeded0/5289ms7000 KiB