Submission #4044756

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repi(i,a,b) for(int i=int(a);i<(int)(b);i++)
#define reps(i,n) for(int i=0;i<=(int)(n);i++)
#define all(x) (x).begin(),(x).end()
#define foreach(u,v) for(auto (u) : (v))
#define pb push_back
#define mp make_pair
#define mt make_tuple

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;

const int inf = 1e9;
const ll linf = 1e18;
const ll mod = 1e9 + 7;
const double eps = 1e-9;

int main()
{
  int n;
  cin >> n;

  vi h(n);
  rep(i, n) cin >> h[i];
  
  vi ts;
  repi(i, 1, n-1){
    if(h[i-1] < h[i] and h[i] > h[i+1]){
      ts.pb(i);
    }
  }
  ts.pb(0);
  ts.pb(n-1);

  int ans = 0;
  foreach(t, ts){
    int s, u;
    for(s = t; s > 0 and h[s-1]<h[s]; s--){
    }
    for(u = t; u < n-1 and h[u]>h[u+1]; u++){
    }

//    printf("%d,%d,%d\n", s, t, u);
    ans = max(ans, u-s+1);
  }

  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result