Read a positive natural number n followed by n integers forming a sequence v[1], v[2], ..., v[n]. A strictly increasing run is a contiguous portion v[i], v[i+1], ..., v[j] such that v[i] < v[i+1] < ... < v[j].
Determine the length of the longest such run and the position where it starts in the sequence, then print the elements of that run.
If there are several runs of maximum length, choose the first one.
The first line contains `n`. The second line contains `n` integers separated by spaces. - `1 <= n <= 1000` - elements are integers in `[-10^9, 10^9]` - a single element forms a strictly increasing run of length `1`
The first line contains two numbers separated by a space: the length of the longest strictly increasing run, followed by the position of its first element in the sequence (positions numbered from `1`). The second line contains the elements of the run, separated by spaces.
8 3 1 2 5 4 7 8 9
4 5 4 7 8 9
Use the Get Hint button in the action bar to reveal a guided hint.
No comments yet. Be the first to start the discussion!
8 3 1 2 5 4 7 8 9
4 5 4 7 8 9
Community solutions unlock after you submit a passing solution. Don't peek.
Create a free account to write code, submit solutions, and track your progress.
