Codeforces Round #321 (Div. 2) A. Kefa and First Steps【暴力/dp/最长不递减子序列】

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

【代码】：

#include <bits/stdc++.h>

using namespace std;
const int N = 1e5+100;
int n,a[N],ans,maxn;
int main()
{
    cin>>n;
    for(int i=0;i<n;i++)//0开始
         cin>>a[i];
    for(int i=1;i<=n;i++)//1开始
    {
        if(a[i]>=a[i-1])
        {
            ans++;
            maxn=max(maxn,ans);
        }
        else
            ans=0;
    }
    cout<<maxn+1<<endl;
    return 0;
}