Codeforces Round #FF (Div. 2)

#include<iostream>
#include<string>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#define N 111111
using namespace std;

int a[N],l[N],r[N];
int main()
{
    int n;
    cin>>n;
    for (int i=1;i<=n;i++){
        cin>>a[i];
        l[i]=r[i]=1;
      }
        int  ans=1;
    for (int i=2;i<=n;i++)
    {
        if (a[i]>a[i-1]) l[i]+=l[i-1];
        ans=max(ans,l[i]);
    }

    for (int i=n-1;i>=1;i--)
        if (a[i]<a[i+1]) r[i]+=r[i+1];

   l[0]=-1;
   r[n+1]=-1;
    a[0]=1111111111;
    a[n+1]=-1;
      for(int i=1;i<=n;i++)
      {
          if (a[i-1]<a[i+1]-1) ans=max(ans,l[i-1]+r[i+1]+1);
          else ans=max(ans,max(r[i+1],l[i-1])+1);
      }

    cout<<ans<<endl;
    return 0;
}