Codeforces Round #321 (Div. 2) 580A Kefa and First Steps(模拟)

题目链接：点击打开链接

问你最长不下降子序列的长度是多少，这题都能错，sigh..

for循环扫一次 记录答案即可。

AC代码：

#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
using namespace std;
const int MAXN = 1e5 + 5;
int n, a[MAXN], ans = 1, x = 1;
int main(int argc, char const *argv[])
{
    scanf("%d", &n);
    for(int i = 0; i < n; ++i)
        scanf("%d", &a[i]);
    for(int i = 1; i < n; ++i) {
        if(a[i] >= a[i - 1]) x++;
        else x = 1;
        ans = max(ans, x);
    }
    printf("%d\n", ans);
    return 0;
}