Codeforces Round #321 (Div. 2)（A）模拟

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

62 2 1 3 4 1

output

3

input

32 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<iostream>#include<cstdio>#include<cstring>#include<algorithm>#define N int(1e5+5)int a[N];using namespace std;int main(){#ifdef CDZSCfreopen("i.txt", "r",stdin);#endifint n,cas=0;while (~scanf("%d", &n)){for (int i = 0; i < n; i++){scanf("%d", a + i);}int ans=-1,last = 0,num=a[0];for (int i = 0; i < n; i++){if (num <= a[i]){num = a[i];}else{num = a[i];ans = max(i - last, ans);last = i;}}ans = max(n - last,ans);printf("%d\n", ans);}return 0;}