Time limit
2000 ms
Memory limit
262144 kB

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.

Example
Input

6 2 2 1 3 4 1Output3Input3 2 2 9Output3

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 <cstdio> #include <iostream> #include <algorithm> #include <cmath> #include <cstring>using namespace std;int main(){int N;cin>>N;int tor;int now;cin>>tor;int maxx = 0;int sum = 1;while(--N){scanf("%d",&now);if(now>=tor)sum++;else {if(sum>maxx)maxx = sum;sum = 1;}tor = now;}if(sum>maxx)maxx = sum;cout<<maxx<<endl;return 0; }

轉載于:https://www.cnblogs.com/vocaloid01/p/9514246.html

總結

以上是生活随笔為你收集整理的CodeForces 580A Kefa and First Steps的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。