Coderforce 602B 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个数的序列，问最长的区间，区间内最大的数和最小的数差小于等于1。

这题我是用两个数组，第一个存的是比原数小1或等于原数。第二个是比原数大1或等于原数。

最长的区间长度为两数组中最大值。

代码为下

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <math.h>
using namespace std;
int main()
{
    int a[100005],b[100005],c[100005];
    int i,j,minn,maxx,f,n,z;
    while(~scanf("%d",&n))
    {
        for(i=0; i<=n; i++)
            c[i]=b[i]=1;
        for(i=1,maxx=-1,f=0; i<=n; i++)
            scanf("%d",&a[i]);
        for(i=1,maxx=0,f=0; i<=n; i++)
        {
            if(a[i]==maxx||a[i]==maxx-1)
                b[i]+=(b[i-1]);
            else
            {
                maxx=a[i]+1,f++;
                for(j=i-1; j>0; j--)
                    if(a[j]==maxx||a[j]==maxx-1)
                        b[i]++;
                    else
                        break;
            }
        }
        for(i=1,maxx=-20,f=0; i<=n; i++)
        {
            if(a[i]==maxx||a[i]==maxx+1)
                c[i]+=(c[i-1]);
            else
            {
                maxx=a[i]-1,f++;
                for(j=i-1; j>0; j--)
                    if(a[j]==maxx||a[j]==maxx+1)
                        c[i]++;
                    else
                        break;
            }
        }
        sort(b,b+n+1);
        sort(c,c+n+1);
        printf("%d\n",max(b[n],c[n]));
    }
}