A sequence is said to be progressive if it doesn't decrease at any point in time.
For example 1 1 2 2 is a progressive sequence but 1 2 1 is not a progressive sequence. Let S be the sequence and be represented by T spaced integers Ki, now your task is to find out the first longest progressive sequence present in the given sequence (S).
Input Format:
First line will contain T, the length of the sequence and next line will contain T spaced integers Ki (where i = 0,1, ...,T).
Line 1
T,where T is the length of the sequence
Line 2
Ki,where Ki is integer in sequence separated by space
Constraints:
1<=T<=10^6(one million)
1<=Ki<=10^9(one billion)
Output Format:
Line 1
longest progressive sequence present in the given sequence
Sample Test Cases:
SNo. Input Output
1
4
1 1 2 1
1 1 2
1
5
1 2 1 2 2
1 2 2
Note:
Participants submitting solutions in C language should not use functions from / as these files do not exist in gcc