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.
1 <= N <= 10^6 1 <= A[i] <= 10^5
Input is managed for you
Output is managed for you
7 1 4 5 2 3 2 4