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
--
You received this message because you are subscribed to the Google Groups
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
To view this discussion on the web visit
https://groups.google.com/d/msgid/google-code/aed2941a-bc75-40bc-af12-0f91d46f915b%40googlegroups.com?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
