跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1983. DZY Loves Sequences

  • ID: 1989
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:进阶
  • 上传者:
  • 动态规划
  • 模拟
  • 双指针
  • 编程与模拟
  • 算法思想
  • 进阶
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

DZY Loves Sequences

题目描述

A. 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.

Examples
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.


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1567 题。保留原作者与原赛事署名。