Codeforces 602B Approximating a Constant Range

description

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 ≤ 100 000) — the number of data points.

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

Output

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

Examples

inputCopy
5
1 2 3 3 2
outputCopy
4
inputCopy
11
5 4 5 5 6 7 8 8 8 7 6
outputCopy
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].

思路

见注释

代码

#include<iostream>
using namespace std;

int a[100005];					//存储每个数字最后出现的下标 

int main()
{
	int n;
	cin>>n;
	int k;
	int ans=-1e5;
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&k);
		a[k]=i;					//更新最新位置 
		if(a[k-1]>a[k+1])
			ans=max(ans,i-max(a[k+1],a[k-2]));
		/* 举例说明。比如k是7，a[k-1]>a[k+1]就是上一个6出现在8的后面，就是8...6...7 之间不可能有大于等于8的数，
			因为如果有，再想下降到7就一定会再次出现8，与之前的8是最后一个8不符。但是其中可以有5，但5和7之间一定有6（876567）。
			所以以7为结尾的序列可能有两种情况，8...6...7，之间不能有5，或者是5...6...7，只需判断5的下标和8的下标谁大即可。
			如果8的下标大，那么之间就肯定没有5，且没有9，只有678三个数，符合条件；如果5大，肯定没有8，而比5小的数如果有，
			5的位置就要改变，所以就只有567三个数。最好更新答案的最大值*/	 
		else
			ans=max(ans,i-max(a[k+2],a[k-1]));	//同理
	}
	cout<<ans; 
	return 0;
}