Codeforces Round #321 (Div. 2) A. 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.

分析 ：最长不降子段

当时SB了 看错了 WA了几次

一定要看清题目

#include
   
   
    
    
#include
    
    
     
     
using namespace std;
int a[100005];
int main(void)
{
    int i,n;
    while(~scanf("%d",&n))
    {
        for(i=0; i
     
     
      
      temp?maxn:temp;
                temp=1;
            }
        }
        maxn=maxn>temp?maxn:temp;
        printf("%d\n",maxn);
    }
    return 0;
}