Algorithm


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 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
Copy
6
2 2 1 3 4 1
output
Copy
3
input
Copy
3
2 2 9
output
Copy
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.



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include<bits/stdc++.h>
#include < limits>
using namespace std;


#define ll long long
#define endl '\n'
#define debug(n) cout<<(n)<<endl;
const ll INF = 2e18 + 99;

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  int n;
  cin>>n;

  int arr[n+1];
  for(int i = 0; i <n; i++){
    cin>>arr[i];
  }
  arr[n] = std::numeric_limits<int>::max();
  int max= 0, count = 0;
  for(int i = 0; i < n; i++){
    count++;
    max = count > max ? count : max;
    if(arr[i] > arr[i+1]){
      count = 0;
    }
  }
  cout<<max<<endl;

}
Copy The Code & Try With Live Editor

Input

x
+
cmd
6
2 2 1 3 4 1

Output

x
+
cmd
3
Advertisements

Demonstration


Codeforcess Solution 580-A A. Kefa and First Steps ,C++, Java, Js and Python ,580-A,Codeforcess Solution

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+