CodeForces 602B Approximating a Constant Range(方法很多,不想费脑子就上线段树)——Codeforces Beta Round #333 (Div. 2)-CSDN博客

本文链接：https://blog.csdn.net/queuelovestack/article/details/50068553

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

/*********************************************************************/

题意：找一个区间内最大值与最小值之差小于等于1的最大区间(即区间长度最长)

解题思路：①利用线段树求出并记录区间的最大值与最小值;②当区间[l,r]满足最大值Max-最小值Min<=1的时候,我们可以扩展区间，即r++;③当不满足的时候我们缩小区间直至再次满足(这里面有种尺取法的思想在)，即l++;④当然，需要一个变量记录最大区间长度;⑤查找复杂度为O(2n)

详细可见代码，不懂的地方可以提出

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<queue>
#include<stack>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<cmath>
#include<string>
#include<algorithm>
#include<iostream>
#define exp 1e-4
using namespace std;
const int N = 100005;
const int M = 100000;
const int inf = 100000;
const int mod = 2009;
struct tree
{
    int left,right,Max,Min;
}s[3*N];
int a[N];
void buildtree(int l,int r,int p)
{
    s[p].left=l,s[p].right=r;
    if(l==r)
    {
        s[p].Max=s[p].Min=a[l];
        return ;
    }
    int mid=(l+r)/2;
    buildtree(l,mid,p*2);
    buildtree(mid+1,r,p*2+1);
    s[p].Max=max(s[p*2].Max,s[p*2+1].Max);
    s[p].Min=min(s[p*2].Min,s[p*2+1].Min);
}
int searchs1(int l,int r,int p)
{
    if(l<=s[p].left&&s[p].right<=r)
        return s[p].Max;
    int mid=(s[p].left+s[p].right)/2;
    if(l>mid)
        return searchs1(l,r,p*2+1);
    else if(r<=mid)
        return searchs1(l,r,p*2);
    else
        return max(searchs1(l,mid,p*2),searchs1(mid+1,r,p*2+1));

}
int searchs2(int l,int r,int p)
{
    if(l<=s[p].left&&s[p].right<=r)
        return s[p].Min;
    int mid=(s[p].left+s[p].right)/2;
    if(l>mid)
        return searchs2(l,r,p*2+1);
    else if(r<=mid)
        return searchs2(l,r,p*2);
    else
        return min(searchs2(l,mid,p*2),searchs2(mid+1,r,p*2+1));

}
int main()
{
    int n,i,j,Max=0;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
        scanf("%d",&a[i]);
    buildtree(1,n,1);
    for(i=j=1;i<=n&&j<=n;)
    {
        if(searchs1(i,j,1)-searchs2(i,j,1)<=1)
        {//printf("%d %d\n",i,j);
            Max=max(Max,j-i+1);
            j++;
        }
        else
            i++;
    }
    printf("%d\n",Max);
    return 0;
}

菜鸟成长记