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

#F1469. Approximating a Constant Range

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

Approximating a Constant Range

题目描述

B. Approximating a Constant Range
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

When Xellos was doing a practice course in university, he once had to measure the intensity of an effect that slowly approached equilibrium. A good way to determine the equilibrium intensity would be choosing a sufficiently large number of consecutive data points that seems as constant as possible and taking their average. Of course, with the usual sizes of data, it's nothing challenging− but why not make a similar programming contest problem while we're at it?

You're given a sequence of n data points a1,...,an. There aren't any big jumps between consecutive data points− for each 1≤i<n, it's guaranteed that |ai+1-ai|≤1.

A range [l,r] of data points is said to be almost constant if the difference between the largest and the smallest value in that range is at most 1. Formally, let M be the maximum and m the minimum value of ai for l≤i≤r; the range [l,r] is almost constant if M-m≤1.

Find the length of the longest almost constant range.

Input

The first line of the input contains a single integer n (2≤n≤100000)− the number of data points.

The second line contains n integers a1,a2,...,an (1≤ai≤100000).

Output

Print a single number− the maximum length of an almost constant range of the given sequence.

Examples
Input
5
1 2 3 3 2
Output
4
Input
11
5 4 5 5 6 7 8 8 8 7 6
Output
5
Note

In the first sample, the longest almost constant range is [2,5]; its length (the number of data points in it) is 4.

In the second sample, there are three almost constant ranges of length 4: [1,4], [6,9] and [7,10]; the only almost constant range of the maximum length 5 is [6,10].


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