洛谷P1567 统计天数

10
1 2 3 2 4 5 6 8 5 9

5

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN=1e7+10;
inline int read()
{
    char c=getchar();int flag=1,x=0;
    while(c<'0'||c>'9')	{if(c=='-')	flag=-1;c=getchar();}
    while(c>='0'&&c<='9')	x=x*10+c-48,c=getchar();return x*flag;
}
int n;
int a[MAXN];
int main()
{
    n=read();
    for(int i=1;i<=n;i++)	a[i]=read();a[0]=0x7ffff;
    int now=0,mx=0;
    for(int i=1;i<=n;i++)
    {
        if(a[i]>=a[i-1])	now++,mx=max(now+1,mx);
        else 				now=0;
    }
    printf("%d",mx);
    return 0;
}