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

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.

求一个序列的连续不降子序列。一个简单dp

dp[i]表示以第i个数为结尾的最长连续不降子序列。

转移方程dp[i]=a[i]>=a[i-1]?dp[i-1]+1:1;

#include
    
    
     
     
#include
     
     
      
      
#include
      
      
       
       
#include
       
       
        
        
using namespace std;

const int N = 100001;
int a[N];
int dp[N];

int main(void)
{
    int n;
    while(~scanf("%d", &n))
    {
        int i, j;
        for(i = 1; i <= n; i++)
            scanf("%d", &a[i]);
        dp[0] = 0;
        a[0] = 0;
        int MAX = 0;
        for(i = 1; i <= n; i++)
        {
            if(a[i] >= a[i-1])
                dp[i] = dp[i-1]+1;
            else
                dp[i] = 1;
            MAX = max(MAX, dp[i]);
        }
        printf("%d\n", MAX);
    }
    return 0;
}