DZY Loves Sequences

给定一个长度为 $n$ 的序列 $a_1\sim a_n$，定义 $a_i,a_{i+1},a_{i+2},\cdots,a_j\left(1\le i\le j\le n\right)$ 的长度为 $j-i+1$，你可以最多更改一个数字，求最长的严格递增子段长度。 ### 输入格式 第一行一个正整数 $n$，表示序列长度。 第二行 $n$ 个整数，表示序列 $a_i$。 ### 输出格式 输出操作后最长严格递增字段长度。（可以不修改数字） ### 限制与约定 对于 $100\%$ 的数据，满足 $1\le n\le10^5,1\le a_i\le10^9$。 ### 样例 1 解释 你可以选择 $a_2\sim a_6$，并将 $a_4$ 修改为 $4$。

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.

The first line contains integer $ n (1<=n<=10^{5}) $ . The next line contains $ n $ integers $ a_{1},a_{2},...,a_{n} (1<=a_{i}<=10^{9}) $ .

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

6
7 2 3 1 5 6

5

You can choose subsegment $ a_{2},a_{3},a_{4},a_{5},a_{6} $ and change its 3rd element (that is $ a_{4} $ ) to 4.