//您注释掉了，我什么也看不见
by rui_er @ 2019-10-08 19:34:21
#include <stdio.h>
------------
int a[1000000];
int main()
------------
------------
{
long long int n,i,j,max=0;
------------
long long int t,k;
scanf("%lld",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
k=i;
t=1;
for(j=k;j<n-1;j++)
{
if(a[j+1]>=a[j])
t++;
else
break;
}
if(t>=max)
max=t;
}
printf("%lld",max);
return 0;
}
by lily1127 @ 2019-10-08 19:38:15
@[rui_er](/space/show?uid=122461) 我又发了一次哦
by lily1127 @ 2019-10-08 19:38:52
```cpp
#include <stdio.h>
int a[1000000];
int main()
{
long long int n,i,j,max=0;
long long int t,k;
scanf("%lld",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
k=i;
t=1;
for(j=k;j<n-1;j++)
{
if(a[j+1]>=a[j])
t++;
else
break;
}
if(t>=max)
max=t;
}
printf("%lld",max);
return 0;
}
```
by rui_er @ 2019-10-08 19:42:05
@[lily1127](/space/show?uid=245696) 你是TLE还是WA
by rui_er @ 2019-10-08 19:44:12
@[lily1127](/space/show?uid=245696) 你复杂度太高超时了
by rui_er @ 2019-10-08 19:48:03
@[rui_er](/space/show?uid=122461) 超时了呢
by lily1127 @ 2019-10-08 19:48:39
@[lily1127](/space/show?uid=245696) 要把$O(n^2)$优化成$O(n)$
by rui_er @ 2019-10-08 19:49:05
@[rui_er](/space/show?uid=122461) 是不是要减一个循环呀
by lily1127 @ 2019-10-08 19:49:19
@[rui_er](/space/show?uid=122461) 好的，我明白了，谢谢大佬，请受小弟一拜
by lily1127 @ 2019-10-08 19:50:10