Mobile coding works. A laptop is faster for long sessions.
Problem
Read a positive natural number `n` followed by `n` integers forming a
sequence `v[1], v[2], ..., v[n]`. A contiguous subarray
`v[i], v[i+1], ..., v[j]` has alternating signs if, traversed from
left to right, the elements alternate between positive and negative:
positive, negative, positive, negative, ... or the reverse.
Determine the length of the longest such subarray and print its elements.
If the value `0` appears in the sequence, it breaks any alternating-sign
run (a zero element is neither positive nor negative).
If there are several subarrays of maximum length, choose the first one.
Input format
Input
input.txt
The first line contains `n`. The second line contains `n` integers separated by spaces. - `1 <= n <= 1000` - `-1000 <= v[i] <= 1000` - a single nonzero element forms an alternating-sign run of length `1`
Output format
Output
output.txt
The first line contains a single natural number: the length of the longest alternating-sign run. The second line contains the elements of that run, separated by spaces.
Example
input
8 3 -1 4 -2 5 5 -6 7
output
5 3 -1 4 -2 5
Stuck?
Use the Get Hint button in the action bar to reveal a guided hint.
💬 Discussion
Loading...💬
No comments yet. Be the first to start the discussion!
💻 No output yet.
Click Run in the editor to execute your code with the custom input.
Sample cases (from the problem)
Sample Case 1
Input
8 3 -1 4 -2 5 5 -6 7
Expected output
5 3 -1 4 -2 5
Solve it your way first
Community solutions unlock after you submit a passing solution. Don't peek.
Ready to solve this challenge?
Create a free account to write code, submit solutions, and track your progress.
⌨️ Keyboard Shortcuts
Code Editor
Run Code
Ctrl
Enter
Submit Code
Ctrl
Shift
Enter
Format Code
Shift
Alt
F
Toggle Comment
Ctrl
/
Undo
Ctrl
Z
Redo
Ctrl
Y
Navigation
Global Search
/
Show Shortcuts
?
Close Modal
Esc