Approximating a Constant Range-codeforces-problem/602/B（思维）

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
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].

题目链接

http://codeforces.com/problemset/problem/602/B

题目大意

一串数字每相邻两数差1，问值在(x,x+1)或（x-1,x）区间内震荡的最长数字串长度。

数据范围

n (2 ≤ n ≤ 100 000)
ai(1 ≤ ai ≤ 100 000)

解题思路

利用桶排序的方法，开数组存位置。每次读入新数字更新数组里的位置i，当前数字x的前一个数，必定是x-1或x+1，且位置是i - 1。若a[x-1] > a[x+1]，则比较（a[x+1],a[x-2])大小）（此为中断条件），再用当前i - 大者就能得到当前数震荡区间，再与ans取大者。反之亦然。

解决代码

#include<cstdio>
#include<algorithm>
using namespace std;
int a[1000005];
int main()
{
int n,ans = 2,x;
scanf("%d",&n);
for(int i = 1; i <= n; i++)
{
    
    scanf("%d",&x);
    a[x] = i;
    if(a[x-1] > a[x+1])
        ans = max(ans,i-max(a[x+1],a[x-2]));
    else
        ans = max(ans,i-max(a[x+2],a[x-1]));
}
printf("%d\n",ans);
return 0;
}