CodeForces 580A Kefa and First Steps

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相关推荐

线段树 + 字符串Hash - Codeforces 580E Kefa and Watch
Kefa and Watch Problem's Link Mean: 给你一个长度为n的字符串s,有两种操作: 1 L R C : 把s[l,r]全部变为c; 2 L R d : 询问s[l,r]是 ...
codeforces 580D Kefa and Dishes
传送门:http://codeforces.com/problemset/problem/580/d 思路:状压DP,f[i][j]表示最后一个为i,已选取的菜的状态为j. #include<c ...
codeforces 580C Kefa and Park（DFS）
题目链接:http://codeforces.com/contest/580/problem/C #include<cstdio> #include<vector> #incl ...
Codeforces Round #321 (Div. 2)
水 A - Kefa and First Steps /************************************************ * Author :Running_Time ...
Codeforces Round #321 (Div. 2) C. Kefa and Park dfs
C. Kefa and Park Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/580/probl ...
Codeforces Round #321 (Div. 2) B. Kefa and Company 二分
B. Kefa and Company Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/580/pr ...
Codeforces Round #321 (Div. 2) Kefa and Company 二分
原题链接:http://codeforces.com/contest/580/problem/B 题意: 给你一个集合,集合中的每个元素有两个属性,$m_i,s_i$,让你求个子集合,使得集合中的最大 ...
【CodeForces - 580D】Kefa and Dishes （状压dp）
题干: kefa进入了一家餐厅,这家餐厅中有n个菜(0<n≤18),kefa对第i个菜的满意度为ai(0≤ai≤10^9),并且对于这n个菜有k个规则,如果kefa在吃完第xi个菜之后吃了第yi ...
CodeForces 1139D Steps to One（概率dp 容斥/莫比乌斯反演）
题目链接https://codeforces.com/contest/1139/problem/D 题意:给定一个m,每次在1-m中随机取一个数放到容器中,当容器的gcd为1时停止,求期望步数,用分数 ...

CodeForces 580A Kefa and First Steps

CodeForces 580A Kefa and First Steps相关推荐

最新文章

热门文章