def solve(self, cipher):
        N, A = cipher
        # SPECIAL CASE
        maxa = max(A)
        if maxa < 0:
            return "%d %d" % (maxa, maxa)

        sum_b = sum(filter(lambda x: x > 0, A))

        sum_a = 0
        current_sum = 0
        for a in A:
            current_sum += a
            if current_sum < 0:
                current_sum = 0
            sum_a = max(sum_a, current_sum)

        return "%d %d" % (sum_a, sum_b)
Add *mapping* dictionary to hashtable.
dataset/ETHPy150Open algorhythms/HackerRankAlgorithms/Dynamic Programming Classics - The Maximum Subarray.py/Solution.solve--crossover with--dataset/ETHPy150Open lsbardel/python-stdnet/stdnet/odm/struct.py/PairMixin.update