Question:codility Lesson4 MaxCounters
My answer:
def solution(N,A):
res = [0] * N
maxnum = 0
curmax = 0
for com in A:
if 1 <= com <= N:
if maxnum > res[com - 1]:
res[com -1] = maxnum
res[com - 1] += 1
if curmax < res[com - 1]:
curmax = res[com - 1]
else:
maxnum = curmax
for i in range(0,N):
if res[i] < maxnum:
res[i] = maxnum
return res