CodeForces 447C

Description

DZY has a sequence a, consisting of n integers.

We'll call a sequence a_i, a_i + 1, ..., a_j(1 ≤ i ≤ j ≤ n) a subsegment of the sequence a. The value (j - i + 1) denotes the length of the subsegment.

Your task is to find the longest subsegment of a, such that it is possible to change at most one number (change one number to any integer you want) from the subsegment to make the subsegment strictly increasing.

You only need to output the length of the subsegment you find.

Input

The first line contains integer n (1 ≤ n ≤ 10⁵). The next line contains n integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹).

Output

In a single line print the answer to the problem — the maximum length of the required subsegment.

Sample Input

Input

6
7 2 3 1 5 6

Output

5

Hint

You can choose subsegment a₂, a₃, a₄, a₅, a₆ and change its 3rd element (that is a₄) to 4.

---

F

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>

using namespace std;

int a[100010];
int b[100010];
int c[100010];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        for(int i=0; i<n; i++)
        {
            scanf("%d",&a[i]);
        }

        b[0]=1;
        for(int j=1; j<n; j++) //从左到右
        {
            if(a[j]>a[j-1])
                b[j]=b[j-1]+1;
            else
                b[j]=1;
        }
        c[n-1]=1;
        for(int i=n-2; i>=0; i--) //从右到左
        {
            if(a[i+1]>a[i])
                c[i]=c[i+1]+1;
            else
                c[i]=1;
        }
        if(n==1)
            printf("1\n");
        else
        {
            int Max=c[1]+1;
            if(Max<b[n-2]+1)
                Max=b[n-2]+1;
            for(int i=1; i<n-1; i++)
            {
                if(a[i+1]>a[i-1]+1)  //矛盾点的寻找
                {
                    if(Max<b[i-1]+c[i+1]+1)
                        Max=b[i-1]+c[i+1]+1;
                }
                else
                {
                    if(Max<b[i-1]+1)
                        Max=b[i-1]+1;
                    if(Max<c[i+1]+1)
                        Max=c[i+1]+1;
                }
            }
            printf("%d\n",Max);
        }

    }
}
/*
1.对于每个数来说，因为可以随意修改，所以就让他等于左边第一个值
和右边第一个值的某个中间值。
然后就是看这个数的左边第一个数向左最大可以延伸的范围
和右边的第一个数向右最大可以延伸的范围
2.注意一下，如果右边数比左边数大1的话，那么是没法修改成某个值使得严格递增的，
所以取延伸范围比较长的某一边。
*/