PROGRAMMING:Longest continuous increasing subsequence
Given a linear table stored in sequence, please design an algorithm to find the longest continuous increasing subsequence in the linear table. For example, the longest increasing subsequence in (1,9,2,5,7,3,4,6,8,0) is (3,4,6,8).
###Input format:
Enter the first line to give the positive integer $$n $$($$Le 10 ^ 5 $$); Line 2 gives $$n $$integers separated by spaces.
###Output format:
Output the longest consecutive increasing subsequence in one line for the first time, and separate the numbers with spaces. There should be no extra spaces at the end of the sequence.
###Input example:
```in
fifteen
1 9 2 5 7 3 4 6 8 0 11 15 17 17 10
```
###Output example:
```out
3 4 6 8
```
answer：If there is no answer, please comment
###Input format:
Enter the first line to give the positive integer $$n $$($$Le 10 ^ 5 $$); Line 2 gives $$n $$integers separated by spaces.
###Output format:
Output the longest consecutive increasing subsequence in one line for the first time, and separate the numbers with spaces. There should be no extra spaces at the end of the sequence.
###Input example:
```in
fifteen
1 9 2 5 7 3 4 6 8 0 11 15 17 17 10
```
###Output example:
```out
3 4 6 8
```
answer：If there is no answer, please comment