Problem description
Kefa decided to make some money doing business on the Internet for exactly n days. He knows that on the i-th day (1 ≤ i ≤ n) he makes ai money. Kefa loves progress, that's why he wants to know the length of the maximum non-decreasing subsegment in sequence ai. Let us remind you that the subsegment of the sequence is its continuous fragment. A subsegment of numbers is called non-decreasing if all numbers in it follow in the non-decreasing order.
Help Kefa cope with this task!
Input
The first line contains integer n (1 ≤ n ≤ 105).
The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print a single integer — the length of the maximum non-decreasing subsegment of sequence a.
Examples
Input
6
2 2 1 3 4 1
Output
3
Input
3
2 2 9
Output
3
Note
In the first test the maximum non-decreasing subsegment is the numbers from the third to the fifth one.
In the second test the maximum non-decreasing subsegment is the numbers from the first to the third one.
解题思路：求最大非递减序列的长度，注意maxlen初始值为1，水过！
AC代码：
1 #include<bits/stdc++.h> 2 using namespace std; 3 int n,len=1,maxlen=1,a[100005]; 4 int main(){ 5 cin>>n; 6 for(int i=0;i<n;++i)cin>>a[i]; 7 for(int i=1;i<n;++i){ 8 if(a[i]>=a[i-1])len++; 9 else len=1; 10 maxlen=max(maxlen,len); 11 } 12 cout<<maxlen<<endl; 13 return 0; 14 }