跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1557. Kefa and First Steps

  • ID: 1563
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:入门
  • 上传者:
  • 枚举
  • 动态规划
  • 模拟
  • 算法思想
  • 编程与模拟
  • 入门
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

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


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1077 题。保留原作者与原赛事署名。