• [C] Hkhv Loves Sequences

  • 时间限制: 1000 ms 内存限制: 65535 K
  • 问题描述
  • Hkhv 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.
  • 输入
  • The first line contains integer n (1 <=n <= 10^5). The next line contains n integers a1,a2,...,an (1 <=ai <= 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 a2,a3,a4,a5,a6 and change its 3rd element (that is a4) to 4.
  • 来源
  • Recoder
  • 操作