1. You are given an array which represents heights of consecutive buildings. 2. You can move from the roof of a building to the roof of next adjacent building. 3. You need to find the maximum number of consecutive steps you can put forward such that you gain an increase in altitude with each step.
Input Format
Input is managed for you
Output Format
Output is managed for you
Constraints
1 <= N <= 10^6 1 <= A[i] <= 10^5
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
7 1 4 5 2 3 2 4
Output
2