Codeforces Round #FF (Div. 2) C DZY Loves Sequences

DZY Loves Sequences

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

DZY has a sequence a, consisting of n integers.

We'll call a sequence ai, ai + 1, ..., aj (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 ≤ 105). The next line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109).

Output

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

Sample test(s)

input

6
7 2 3 1 5 6

output

5

Note

You can choose subsegment a2, a3, a4, a5, a6 and change its 3rd element (that is a4) to 4.

思路：把这串数分成各个小串，每部分小串保证严格递增，然后就是遍历，前后相邻的小串能否改变其中一个数组成一个大串，另一种情况就是三个相邻的串，中间那个小串长度必须为1，然后要改变的数也必须是长度为1的中间串，

让我一直WA的原因就是当小串数大于1 的时候，ans=max(小串长度)+1，我却写成了ans=max(小串长度)，过了比赛查看第三组数据时才发现

#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <ctime>

using namespace std;

const int maxn=111111;

int n;
int a[maxn];

int l[maxn];

struct node{
    int len,l;
}vis[maxn];


int main()
{
    scanf("%d",&n);

    memset(l,1,sizeof(l));

    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    for(int i=2;i<=n;i++)
    {
        if(a[i]>a[i-1])
            l[i]=l[i-1]+1;
        else
            continue;
    }

    /*for(int i=1;i<=n;i++)
        printf("%d ",l[i]);
    cout<<endl;*/
    memset(vis,0,sizeof(vis));

    int pre=1;

    int cnt=0;

    for(int i=2;i<=n;i++)
    {
        if(l[i]>l[i-1])
            continue;
        else
        {
            vis[cnt].l=pre;
            vis[cnt].len=i-1-pre+1;
            pre=i;
            cnt++;
        }
    }
    vis[cnt].l=pre;
    vis[cnt].len=n-pre+1;
    cnt++;

    int ans=1;


    for(int i=0;i<cnt;i++)
    {
        //cout<<vis[i].L<<" "<<vis[i].R<<" "<<vis[i].len<<" "<<vis[i].l<<endl;
       if(cnt>1)
        ans=max(ans,vis[i].len+1);
       else
        ans=max(ans,vis[i].len);

        if(i+1<cnt)
        {
            int x=vis[i].l;
            int y=vis[i+1].l;
            if(vis[i].len==1 && a[vis[i+1].l]>1)
                    ans=max(ans,vis[i+1].len+1);
            else
            {
                if(vis[i+1].len==1)
                {
                    ans=max(ans,vis[i].len+1);
                }
                else
                {
                    if(a[y+1]-a[x+vis[i].len-1]>1)
                      ans=max(ans,vis[i].len+vis[i+1].len);
                    else
                    {
                        if(a[y]-a[x+vis[i].len-1-1]>1)
                         ans=max(ans,vis[i].len+vis[i+1].len);
                    }
                }
            }
        }

        if(i+2<cnt && vis[i+1].len==1)
        {
            if(a[vis[i+2].l]-a[vis[i].l+vis[i].len-1]>1)
                ans=max(ans,vis[i].len+vis[i+2].len+1);
        }
    }

    cout<<ans<<endl;

    return 0;
}