Submission #2211742

---

Source Code Expand

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

#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define mp(a,b) make_pair(a,b)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;

#define INF 1e15

#define MAX_N 1000

int n;
ll h[311111];
ll l[311111],r[311111];

int main(){
  cin.sync_with_stdio(false);
  cin>>n;
  rep(i,n)cin>>h[i];
  ll res=0;

  int cnt=1;
  repl(i,1,n){
    if(h[i-1]>=h[i]){
      cnt=0;
    }
    l[i]=cnt;
    cnt++;
  }

  cnt=1;
  for(int i=n-2;i>=0;i--){
    if(h[i+1]>=h[i]){
      cnt=0;
    }
    r[i]=cnt;
    cnt++;
  }

  rep(i,n)maxch(res,l[i]+r[i]+1);
  cout<<res<<endl;
  return 0;
}

Submission Info

Judge Result