A. Kefa and First Steps（找最长非递降子序列的长度）

C - 3 CodeForces - 580A
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.
问题简述：在一串数字内，找到一串相邻的数是非递降序列并计算最长序列的长度
问题分析：这个题可以通过数组（或动态数组）保存这串数字，利用for循环比较相邻两个数，如果是前者小于等于后者，n+=1(n表示子序列长度）。要考虑到子序列后面有一段递减序列再有非递降序列的情况，需要把n=1，重新计算序列长度，我们会得到几组子序列，需要比较序列长度。还要注意循环i的取值范围。
两个AC的C++程序如下：