Dynamic Programming solution to problem http://codeforces.com/problemset/problem/66/B

c.cpp

#include <bits/stdc++.h>

using namespace std;

int l[1024],r[1024],h[1024];

int main() {
  int n,res = 0;
  
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> h[i];
  }
  for (int i = 1; i < n; ++i) {
    if (h[i] >= h[i - 1]) {
      l[i] = 1+l[i-1];
    }
  }
  for (int i = n - 2; i >= 0; --i) {
    if (h[i] >= h[i+1]) {
      r[i] = 1+r[i+1];
    }
  }
  for (int i = 0; i < n; ++i) {
    res = max(res,1+l[i]+r[i]);
  }
  cout << res << "\n";
  return 0;
}