CodeForces - 580A Kefa and First Steps （求连续不递减数列）

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.
问题链接：http://codeforces.com/problemset/problem/580/A
问题简述：第一行输入一个数字n，第二行输入n个随意排列的数字。要求其中不是单调递减数列的项最多有多少（单调递增或等）
问题分析：先设立两个数字，用一次循环把所有的单调增（等）数列的项数都算出来，取大值输出即可
AC通过的C++语言程序如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int *p = new int[n];
	for (int i = 0; i < n; i++)
	{
		cin >> p[i];
	}
	int res = 0, k = 1;
	for (int i = 1; i < n; i++)
	{
		if (p[i] >= p[i - 1]) { k++; }
		else { res = max(res, k); k = 1; }
	}
	res = max(res, k);
	cout << res;
	return 0;
}