245252026-02-12 17:19:02VikiVölgy (100 pont)python3Wrong answer 20/100300ms7216 KiB
N = int(input()) #elemek szama
M = [] #magasagok
for i in range (N):
    M.append(int(input()))
a = 0 #aktualis hossz
h = 0 #eddigi leghosszabb
L = 0 #jelenlegi legmagasabb
i = 0
N = []

while M[i] <= M[i+1]: #felesleges elemek a lista elejetol
    M.pop(i)
M.reverse() 
while M[i] <= M[i+1]: #felesleges elemek a lista hatuljatol
    M.pop(i)
M.reverse() #eredeti sorrendre
i=0
for i in range(len(M)):
    if M[i] >= L: #ha a jelenlegi elem nagyobb az elozo legnagyobbnal
        if a>h:
            h = a
            a = 0
        L = M[i]
    else:
        a += 1
i = 0
a = 0
M.reverse()
if M[i] < L:
    N.append(M[0])
    while M[i] != L:
        i += 1
        N.append(M[i])
    M = N
i = 0
L = 0
for i in range(len(M)):
    if M[i] >= L: #ha a jelenlegi elem nagyobb az elozo legnagyobbnal
        if a>h:
            h = a
            a = 0
        L = M[i]
    else:
        a += 1

print(h+1)
SubtaskSumTestVerdictTimeMemory
base20/100
1Accepted0/016ms3144 KiB
2Wrong answer0/017ms3124 KiB
3Wrong answer0/517ms3124 KiB
4Accepted5/516ms3144 KiB
5Wrong answer0/517ms3184 KiB
6Accepted5/516ms3020 KiB
7Runtime error0/516ms2988 KiB
8Wrong answer0/516ms3016 KiB
9Runtime error0/517ms3124 KiB
10Wrong answer0/517ms3136 KiB
11Accepted5/524ms3376 KiB
12Wrong answer0/530ms3128 KiB
13Wrong answer0/530ms3632 KiB
14Wrong answer0/532ms3616 KiB
15Wrong answer0/5162ms7040 KiB
16Wrong answer0/5171ms7216 KiB
17Time limit exceeded0/5300ms7116 KiB
18Time limit exceeded0/5300ms7112 KiB
19Time limit exceeded0/5287ms7068 KiB
20Accepted5/5184ms7112 KiB
21Time limit exceeded0/5280ms7040 KiB
22Wrong answer0/5185ms7108 KiB