Kefa and First Steps

A. Kefa and First Steps

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 sequenceai. 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.

Sample test(s)

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.

简单dp题，找到最大的非递减连续序列。

AC代码·：

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef __int64 ll;
int main(){
    /*freopen("input.txt","r",stdin);*/
    ll n,i,j,k,cnt,c;
    while(~scanf("%I64d",&n))
    {
        j=0;cnt=c=0;
        for(i=0;i<n;++i){
            scanf("%I64d",&k);
            if(j<=k){
                c++;
            }else
            {
                c=1;
            }
            j=k;
            cnt = max(c,cnt);
        }
        printf("%I64d\n",cnt);
    }
   return 0;
}