Codeforces Round #333 (Div. 2) B. 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 ≤ 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 test(s)

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

题意：给你一个长度为n的序列，求其中连续子序列max-min<=1的长度最大为多少

应该是一个简单题，昨天晚上想了很久，但是没有想到一个简单方法。

我用的是树状数组+二分

二分 连续子序列max-min<=1的长度，判断一个长度可不可以直接模拟肯定是不行的，我们可以用树状数组优化，就可以达到logn的时间查找

详见代码

#include
          
          
           
           
#include
           
           
            
            
#include
            
            
             
             
#include
             
             
              
              
using namespace std;

const int N = 100001;
int a[N];
int idx_max[N];
int num[N];
int idx_min[N];


int lowbit(int x)
{
    return x&(-x);
}

void Init_max(int n)
{
    for(int i = 1; i <= n; i++)
    {
        idx_max[i] = num[i];
        for(int j = 1; j < lowbit(i); j <<= 1)
        {
            idx_max[i] = max(idx_max[i], idx_max[i-j]);
        }
    }
}

int Query_max(int l, int r)//求l到r位置内的最大值
{
    int ans = num[r];
    while(true)
    {
        ans = max(ans, num[r]);
        if(l == r) break;
        for(r-=1; r-l >= lowbit(r); r -= lowbit(r))
        {
            ans = max(ans, idx_max[r]);
        }
    }
    return ans;
}

void Init_min(int n)
{
    for(int i = 1; i <= n; i++)
    {
        idx_min[i] = num[i];
        for(int j = 1; j < lowbit(i); j <<= 1)
        {
            idx_min[i] = min(idx_min[i], idx_min[i-j]);
        }
    }
}

int Query_min(int l, int r)//求l到r位置内的最小值
{
    int ans = num[r];
    while(true)
    {
        ans = min(ans, num[r]);
        if(l == r) break;
        for(r-=1; r-l >= lowbit(r); r -= lowbit(r))
        {
            ans = min(ans, idx_min[r]);
        }
    }
    return ans;
}

int n;

int check(int len)//直接模拟判断长度为len是否可以，1表示可以，0表示不可以
{
    int i;
    int MAX, MIN;
    for(i = 1; i+len-1 <= n; i++)
    {
        MAX = Query_max(i, i+len-1);
        MIN = Query_min(i, i+len-1);
        if(MAX - MIN <= 1) return 1;
    }
    return 0;
}

int main(void)
{

    scanf("%d", &n);
    for(int i = 1; i <= n; i++) scanf("%d", &num[i]);
    Init_min(n); Init_max(n);
    int MAX = 0;
    int MIN = 0;
    int i = 1, j = n;
    int ans = 0;
    while(i < j)//二分找长度
    {
        int mid = (i+j)/2;
        int tmp  = check(mid);
//        printf("mid=%d \t tmp=%d\n", mid, tmp);
        if(tmp) i = mid+1;
        else j = mid-1;

    }
    if(check(i)) ans = i;
    else ans = i-1;
    printf("%d\n", ans);
    return 0;
}