CF1272D.Remove One Element

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

You are given an array $a$ consisting of $n$ integers.

You can remove at most one element from this array. Thus, the final length of the array is $n-1$ or $n$ .

Your task is to calculate the maximum possible length of the strictly increasing contiguous subarray of the remaining array.

Recall that the contiguous subarray $a$ with indices from $l$ to $r$ is $a[l \dots r] = a_l, a_{l + 1}, \dots, a_r$ . The subarray $a[l \dots r]$ is called strictly increasing if $a_l < a_{l+1} < \dots < a_r$ .

输入格式

The first line of the input contains one integer $n$ ( $2 \le n \le 2 \cdot 10^5$ ) — the number of elements in $a$ .

The second line of the input contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le 10^9$ ), where $a_i$ is the $i$ -th element of $a$ .

输出格式

Print one integer — the maximum possible length of the strictly increasing contiguous subarray of the array $a$ after removing at most one element.

输入输出样例

输入#1
```
5
1 2 5 3 4
```
输出#1
```
4
```
输入#2
```
2
1 2
```
输出#2
```
2
```
输入#3
```
7
6 5 4 3 2 4 3
```
输出#3
```
2
```

说明/提示

In the first example, you can delete $a_3=5$ . Then the resulting array will be equal to $[1, 2, 3, 4]$ and the length of its largest increasing subarray will be equal to $4$ .

首页