CodeForces 580A Kefa and First Steps

题意：求最长不递减子序列

思路：直接扫一遍就好了...

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5+6;
int ans = 0;
int a[maxn];
int anss = 0;
int main()
{
     int n;
	 scanf("%d",&n);
	 for (int i = 1;i<=n;i++)
		 scanf("%d",&a[i]);
	 for (int i = 2;i<=n;i++)
	 {
		 if (a[i]>=a[i-1])
		 {
			 anss++;
			 ans = max(ans,anss);
		 }
		 else
			 anss=0;
	 }
	 printf("%d\n",ans+1);
}

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 a_i money. Kefa loves progress, that's why he wants to know the length of the maximum non-decreasing subsegment in sequencea_i. 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 ≤ 10⁵).

The second line contains n integers a₁,  a₂,  ...,  a_n (1 ≤ a_i ≤ 10⁹).

Output

Print a single integer — the length of the maximum non-decreasing subsegment of sequence a.

Sample Input

Input

6
2 2 1 3 4 1

Output

3

Input

3
2 2 9

Output

3

Hint

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.