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. 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 Input Format The first line contains the size of the integer array. The second line contains the integer array. Constraints: - 0 <= size <= 2147483647 - each element <= 2147483647 and >= 0 Input Sample 6 2·4·5·1·7·3 Output Format A single line containing the largest sum of an ascending sequence of the array Output Sample 11
Make a C# programming of:
1. Ascend!
by CodeChum
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.
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
Input Format
The first line contains the size of the integer array. The second line contains the integer array. Constraints: - 0 <= size <= 2147483647 - each element <= 2147483647 and >= 0
Input Sample
Output Format
A single line containing the largest sum of an ascending sequence of the array
Output Sample
Step by step
Solved in 2 steps
