Submission #869676

#	Time	Username	Problem	Language	Result	Execution time	Memory
869676		Hoang_Coder	Baloni (COCI15_baloni)	Cpython 3	0 / 100	2076 ms	108532 KiB

baloni

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