Codeforces Round #321 A Kefa and First Steps

#include<cstdio>
const int maxn=110000;
int a[maxn];
int n;
int main(){
while(scanf("%d",&n)!=EOF){
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
int x;int y;int z;
x=y=1;z=a[0];
int falg=0;
for(int i=1;i<n;i++){
if(a[i]>=z){
z=a[i];
x++;
}
else{
z=a[i];
if(x>y)
y=x;
x=1;
}
}
if(x>y)
y=x;
printf("%d\n",y);
}
return 0;
}