oj.uz

Submission #869676

# Submission time Handle Problem Language Result Execution time Memory
869676 2023-11-05T09:33:38 Z Hoang_Coder Baloni (COCI15_baloni) Python 3
0 / 100
 2000 ms 108532 KB 
n = int(input())
inps = [int(x) for x in input().split()]
kq = []
def constang(array):
    ls = [array[0]]
    nn = array[0]
    for i in range(len(array)):
        if nn <= array[i]:
            ls.append(array[i])
            nn = array[i]
    return ls
cjd = []
for j in range(len(inps)):
    kq.append(constang(inps[j:]))
for i in kq:
    cjd.append(len(i))
print(max(cjd))

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 3156 KB Output isn't correct
2 Incorrect 101 ms 3168 KB Output isn't correct
3 Incorrect 395 ms 3888 KB Output isn't correct
4 Incorrect 560 ms 4016 KB Output isn't correct
5 Execution timed out 2017 ms 97192 KB Time limit exceeded
6 Execution timed out 2011 ms 108532 KB Time limit exceeded
7 Execution timed out 2076 ms 86012 KB Time limit exceeded
8 Execution timed out 2024 ms 85184 KB Time limit exceeded
9 Execution timed out 2023 ms 92672 KB Time limit exceeded
10 Execution timed out 2054 ms 94388 KB Time limit exceeded