Kefa_and_First_Steps.c

/* 
*
*Link to problem http://codeforces.com/contest/580/problem/A
*
*solution official : http://codeforces.com/blog/entry/20468
*The next code, was my implementation for the problem. 
*/
#include<stdio.h>
int array[100003];
int main(){
  int n,i,max,count;
  scanf("%d",&n);
  for( i =0; i< n; i++)
    scanf("%d", &array[i]);
  max = count =1;
  for(i =1; i < n ; i++){
    if(array[i] >= array[i-1])
      count++;
    else if(max < count){
      max = count;
      count =1;
    }else count =1;

  }
  if(max < count) max = count;
  printf("%d",max);


return 0;
}