CodeForces - 580A Kefa and First Steps【C++练习题】_c++ zhuozhuo and first steps-优快云博客

本文链接：https://blog.youkuaiyun.com/weixin_43971480/article/details/86698156

本文介绍了一种求解最长连续非递减子序列的方法，通过遍历序列并比较相邻元素，实现对最大非递减子序列长度的计算。

A. Kefa and First Steps
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard 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
inputCopy
6
2 2 1 3 4 1
outputCopy
3
inputCopy
3
2 2 9
outputCopy
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.

问题简述：
求最长连续上升子序列

贴上代码↓↓↓

#include <iostream>
#include <algorithm>
using namespace std;
void main()
{
	int n;
	double a,b;
	int s = 1;
	int max1 = 0;
	cin >> n;
	cin >> a;
	while (--n)
	{
		cin >> b;
		if (b >= a)s++;
		else
		{
			if (s > max1)max1 = s;
			s = 1;
		}
		a = b;
	}
	if (s > max1)max1 = s;
	cout << max1;
}```