Answer to Question #260152 in Python for zgr

Question

Ascend!

by CodeChum Admin

Hey I’ve got this cool idea for an app! It’s kind of simple but just hear me out. All the user has to do is enter a bunch of integers. Then the application prints the largest sum of a strictly ascending sequence of the array. A strictly ascending sequence is a sequence where the current number is always lesser than the next number. 

For example, the user enters 2 4 5 1 7 3, the output should be 11 (2 + 4 + 5).

Then that’s it! I think this is going to be a hit! Don’t you think? Well I do. If you help me then we’re going to be rich!

Note: For this problem, a sequence must contain at least 2 numbers. If there is no sequence found, then the largest sum is 0.

Input

1. The size of the array

Constraints

The value is within the range: 0 <= size <= 2147483647

2. Elements of the array

Constraints

Each element <= 2147483647 and >= 0

Output

Answer 1

list1 = [2,4,5,1,7,3]
list2 = []
previous = list1[0]
list2.append(previous)
for i in list1[1:]:
    if previous < i:
        list2.append(i)
    else:
        break
    previous = i
        
print(sum(list2))
11