暑假训练 CodeForces 602B Approximating a Constant Range

F - Approximating a Constant Range
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit Status Practice CodeForces 602B
use MathJax to parse formulas

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.

Sample Input
Input

5
1 2 3 3 2

Output

4

Input

11
5 4 5 5 6 7 8 8 8 7 6

Output

5

Hint

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>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <set>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#define ULL unsigned long long
using namespace std;
const int maxn=1e6+50;
const int inf=0x3f3f3f3f;
int a[maxn];
int main()
{
        int i,n,m,j=0,k,l,max1=-1,min1=inf,maxi,mini;//maxi,mini最大值，最小值的最新坐标
        scanf("%d",&n);
        for(i=0;i<=n-1;i++)
        {
            scanf("%d",&a[i]);
        }
        int ans=-1;i=0;
        while(i<=n-1)
        {
            if(a[i]>max1)
            {
                maxi=i;
                max1=a[i];
            }
            if(a[i]<min1)
            {
                mini=i;
                min1=a[i];
            }
            if(max1-min1<=1)
            {
                i++;
                j++;
            }
            else
            {
                ans=max(ans,j);
                i=min(mini,maxi)+1;//选择坐标较小的那个，一次开起点开始下一次查找
                j=0;//初始化
                max1=-1;
                min1=inf;
            }
        }
        ans=max(ans,j);//最后一次判断
        printf("%d\n",ans);
        return 0;
}