245302026-02-12 17:24:32VikiVölgy (100 pont)python3Wrong answer 20/100300ms7168 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/017ms3112 KiB
2Wrong answer0/017ms3112 KiB
3Accepted5/517ms3124 KiB
4Accepted5/516ms3116 KiB
5Wrong answer0/517ms3120 KiB
6Wrong answer0/516ms3136 KiB
7Runtime error0/517ms3116 KiB
8Wrong answer0/516ms3120 KiB
9Runtime error0/517ms3148 KiB
10Wrong answer0/517ms3172 KiB
11Accepted5/523ms3336 KiB
12Wrong answer0/529ms3188 KiB
13Wrong answer0/532ms3472 KiB
14Wrong answer0/532ms3368 KiB
15Wrong answer0/5165ms7168 KiB
16Wrong answer0/5163ms6928 KiB
17Time limit exceeded0/5300ms7016 KiB
18Time limit exceeded0/5300ms7068 KiB
19Time limit exceeded0/5300ms6916 KiB
20Accepted5/5162ms6916 KiB
21Time limit exceeded0/5287ms6924 KiB
22Wrong answer0/5166ms6932 KiB