CodeForces 580A Kefa and First Steps

Time limit
2000 ms
Memory limit
262144 kB

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.

Example
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 <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>

using namespace std;

int main(){
    int N;
    cin>>N;
    int tor;
    int now;
    cin>>tor;
    int maxx = 0;
    int sum = 1;
    while(--N){
        scanf("%d",&now);
        if(now>=tor)sum++;
        else {
            if(sum>maxx)maxx = sum;
            sum = 1;
        }
        tor = now;
    }
    if(sum>maxx)maxx = sum;
    cout<<maxx<<endl;
    return 0;
}