Longest Non-Decreasing Subarray
Problem
Given an array of Integers A , find the length of Longest sub-array whose elements are in Non-Decreasing Order.
Input:
First line of input contains N size of array A. Next line contains N space separated elements of array.
Output:
Print the length of longest sub-array whose elements are in increasing order .
Constraints:
1≤N≤100000
0≤A[i]≤1000000
Time Limit: 1
Memory Limit: 256
Source Limit:
