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.
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).
Print a single number — the maximum length of an almost constant range of the given sequence.
5 1 2 3 3 2
4
11 5 4 5 5 6 7 8 8 8 7 6
5
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,下面一行输入n个数,找区间,区间中的最大值和最小值的差要小于等于1,输出这样的区间的最大的长度;
思路:看到区间中的最大值最小值,你会不会想到 线段树呢,查找区间时,你会不会想到用尺取法尺取呢;
代码:
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define Max 500050
struct node
{
int ma;
int mi;
}stu[Max];
int a[Max/5],Mi,Ma;
void build(int root,int a[],int star,int end) // 线段树建树
{
if(star == end)
{
stu[root].ma = stu[root].mi = a[star];
return ;
}
int mid = (star + end)/2;
build(2*root,a,star,mid);
build(2*root+1,a,mid+1,end);
stu[root].ma = max(stu[2*root].ma,stu[2*root+1].ma);
stu[root].mi = min(stu[2*root].mi,stu[2*root+1].mi);
}
void query(int root,int star,int end,int i,int j) // 线段树查找区间
{
if(star>=i&&end<=j)
{
Ma = max(Ma,stu[root].ma);
Mi = min(Mi,stu[root].mi);
return ;
}
int t1,t2,mid = (star + end)/2;
if(i<=mid)
{
query(2*root,star,mid,i,j);
}
if(mid<j)
{
query(2*root+1,mid+1,end,i,j);
}
}
int main()
{
int i,j,n;
while(~scanf("%d",&n))
{
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
build(1,a,1,n);
int l=1,r=2,ans = 1;
while(r<=n) // 尺取法 设定 l 头,r 尾;尺取区间;
{
while(r<=n)
{
Ma = 0;
Mi = Max;
query(1,1,n,l,r);
if(Ma-Mi<=1)
r++;
else break;
}
ans = max(ans,r-l);
l++;
}
printf("%d\n",ans);
}
return 0;
}