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

input
5
1 2 3 3 2
output
4
input
11
5 4 5 5 6 7 8 8 8 7 6
output
5

题目大意

在给定序列中找最长的一段子序列，满足其中任意两个数字之差不大于1.

解题思路

用a[i]来标记序列中当前数字i 所在子序列满足的最大长度，因为数字只差不能大于1，则对于一段子序列有贡献的只可能是两个相邻的值（设为i 和 i+1），只要出现了第三个值则该段结束，则当我们读到数字i 时，需将a[i] 和a[i+1] 分别+1，相反，应将a[i+2]和a[i-1]、a[i-2]置为0，并在统计的过程中不断更新最大值.

代码实现

#include <iostream>
#include<cstring>
#include<vector>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<queue>
#include<cstdio>
typedef long long ll;
const int maxn=1e5+7;
using namespace std;
int a[maxn]; 
int main(int argc, char *argv[]) {
     int n;
     scanf("%d",&n);
     memset(a,0,sizeof(a));
     int ans=0;
     int t;
     for(int i=0;i<n;i++)
     {
        scanf("%d",&t); 
        a[t]++,a[t+1]++,a[t-1]=0,a[t-2]=0;
        a[t+2]=0; 
        ans=max(ans,a[t]);
        ans=max(ans,a[t+1]);
     }
     printf("%d\n",ans);
    return 0;
}