07_codility_counters.py

#!/usr/bin/env python


def solution(N, A):
    counters = [0] * N
    max_counter = 0
    all_inc = 0
    N1 = N + 1

    for i in range(len(A)):
        if 1 <= A[i] <= N:
            if counters[A[i] - 1] < all_inc:
                counters[A[i] - 1] = all_inc

            counters[A[i] - 1] += 1

            if counters[A[i] - 1] > max_counter:
                max_counter = counters[A[i] - 1]

        elif A[i] == N1:
            all_inc = max_counter

    for j in range(len(counters)):
        counters[j] = max(counters[j], all_inc)

    return counters


print solution(5, [3, 4, 4, 6, 1, 4, 4])
#https://codility.com/demo/results/demoKHVSJH-8HJ/