🔒 Closed C LANGUAGE PA HELP PO?

[m a e 0 9]

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
The first line will contain a message prompt to input the size. The succeeding lines will contain a message prompt to input the elements of the array. The last line will contain the largest sum of an ascending sequence of the array.
Enter·the·size:·6
Enter·element·#1:·2
Enter·element·#2:·4
Enter·element·#3:·5
Enter·element·#4:·1
Enter·element·#5:·7
Enter·element·#6:·3
Largest·sum·=·11