题目链接:点击这里
题目大意:
t
t
t 组样例,每组样例给出一个长度为
n
n
n 的序列
a
1
,
a
2
,
.
.
.
,
a
n
a_1,a_2,...,a_n
a1,a2,...,an ,
m
m
m 组询问,每组询问给出一对
l
,
r
l,r
l,r ,求区间
[
l
,
r
]
[l,r]
[l,r] 内的数字是否连续
题目分析:
区间是否连续可以转化为:区间最值之差是否小于等于区间的元素个数
区间最值是典型的
R
M
Q
RMQ
RMQ 问题,我用了线段树维护 不用
S
T
ST
ST 表是因为太久没写了忘记怎么写了
区间元素个数就可以用普通莫队来维护
还有个小操作:因为
a
i
≤
1
e
9
a_i\le 1e9
ai≤1e9 所以需要离散化一下来控制计数数组大小
具体细节见代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
int read()
{
int res = 0,flag = 1;
char ch = getchar();
while(ch<'0' || ch>'9')
{
if(ch == '-') flag = -1;
ch = getchar();
}
while(ch>='0' && ch<='9')
{
res = (res<<3)+(res<<1)+(ch^48);//res*10+ch-'0';
ch = getchar();
}
return res*flag;
}
const int maxn = 1e5+5;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-8;
struct sgt{
int maxx,minn;
}a[maxn<<2];
int n,m,block,num[maxn],b[maxn],cnt[maxn];
bool ans[maxn];
vector<int>v;
void pushup(int root)
{
a[root].maxx = max(a[root<<1].maxx,a[root<<1|1].maxx);
a[root].minn = min(a[root<<1].minn,a[root<<1|1].minn);
// a[root].minn = min(!a[root<<1].minn ? inf : a[root<<1].minn,!a[root<<1|1].minn ? inf : a[root<<1|1].minn);
}
void build(int root,int l,int r)
{
if(l == r)
{
a[root].maxx = a[root].minn = num[l];
return;
}
int mid = l+r>>1;
build(root<<1,l,mid);
build(root<<1|1,mid+1,r);
pushup(root);
}
int query_max(int root,int l,int r,int ql,int qr)
{
if(l>qr || r<ql) return 0;
if(l>=ql && r<=qr) return a[root].maxx;
int mid = l+r>>1;
return max(query_max(root<<1,l,mid,ql,qr),query_max(root<<1|1,mid+1,r,ql,qr));
}
int query_min(int root,int l,int r,int ql,int qr)
{
if(l>qr || r<ql) return inf;
if(l>=ql && r<=qr) return a[root].minn;
int mid = l+r>>1;
return min(query_min(root<<1,l,mid,ql,qr),query_min(root<<1|1,mid+1,r,ql,qr));
}
struct query{
int l,r,id;
friend bool operator < (const query &a,const query &b)
{
return (a.l/block)^(b.l/block)?a.l<b.l:(((a.l/block)&1)?a.r<b.r:a.r>b.r);
}
}q[maxn];
int main()
{
int t = read();
while(t--)
{
v.clear();
n = read(),m = read();
for(int i = 0;i <= max(n,m);i++) cnt[i] = ans[i] = 0;
block = n/sqrt(m*2/3);
for(int i = 1;i <= n;i++)
v.push_back(num[i] = read());
sort(v.begin(),v.end());
v.erase(unique(v.begin(),v.end()),v.end());
for(int i = 1;i <= n;i++)
b[i] = lower_bound(v.begin(),v.end(),num[i])-v.begin();
build(1,1,n);
for(int i = 1;i <= m;i++)
q[i].l = read(),q[i].r = read(),q[i].id = i;
sort(q+1,q+m+1);
int l = 1,r = 0,now = 0;
for(int i = 1;i <= m;i++)
{
int ql = q[i].l,qr = q[i].r;
while(l>ql) now += !cnt[b[--l]]++;
while(l<ql) now -= !--cnt[b[l++]];
while(r>qr) now -= !--cnt[b[r--]];
while(r<qr) now += !cnt[b[++r]]++;
int val = query_max(1,1,n,l,r)-query_min(1,1,n,l,r)+1;
if(val <= now) ans[q[i].id] = true;
else ans[q[i].id] = false;
}
for(int i = 1;i <= m;i++)
if(ans[i]) puts("YES");
else puts("NO");
}
return 0;
}