题目描述
题解
把长度为k的子串hash起来然后离散化
建立可持久化权值线段树,每一次在一段区间上查询即可
代码
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
#define UNLL unsigned long long
#define N 100005
const UNLL S=20000010001LL;
int n,m,k,sz,LSH,cnt,l,r,x,ans;
int a[N],root[N];
UNLL mi[N],hash[N],lsh[N];
int sum[N*20],ls[N*20],rs[N*20];
UNLL now;
int find(UNLL x)
{
int l=1,r=LSH,mid,ans=0;
while (l<=r)
{
mid=(l+r)>>1;
if (lsh[mid]==x) ans=mid,r=mid-1;
else if (lsh[mid]>x) r=mid-1;
else l=mid+1;
}
return ans;
}
void change(int &now,int l,int r,int x)
{
int mid=(l+r)>>1;
sum[++sz]=sum[now]+1;ls[sz]=ls[now];rs[sz]=rs[now];now=sz;
if (l==r) return;
if (x<=mid) change(ls[now],l,mid,x);
else change(rs[now],mid+1,r,x);
}
int query(int L,int R,int l,int r,int x)
{
int mid=(l+r)>>1;
if (l==r) return sum[R]-sum[L];
if (x<=mid) return query(ls[L],ls[R],l,mid,x);
else query(rs[L],rs[R],mid+1,r,x);
}
int main()
{
scanf("%d%d%d",&n,&m,&k);
if (k>n)
{
for (int i=1;i<=m;++i)
puts("No");
return 0;
}
for (int i=1;i<=n;++i) scanf("%d",&a[i]);
mi[0]=1LL;for (int i=1;i<=k;++i) mi[i]=mi[i-1]*S;
for (int i=1;i<=k;++i) now+=mi[k-i]*(UNLL)a[i];
hash[1]=lsh[1]=now;
for (int i=k+1;i<=n;++i)
{
now*=S;now+=(UNLL)a[i];now-=mi[k]*(UNLL)a[i-k];
hash[i-k+1]=lsh[i-k+1]=now;
}
cnt=n-k+1;sort(lsh+1,lsh+cnt+1);
LSH=unique(lsh+1,lsh+cnt+1)-lsh-1;
for (int i=1;i<=cnt;++i)
{
a[i]=find(hash[i]);
root[i]=root[i-1];
change(root[i],1,LSH,a[i]);
}
for (int i=1;i<=m;++i)
{
scanf("%d%d",&l,&r);
r=r-k+1;
now=0;
for (int j=1;j<=k;++j)
{
scanf("%d",&x);
now*=S;now+=(UNLL)x;
}
int val=find(now);
if (!val) {puts("Yes");continue;}
ans=query(root[l-1],root[r],1,LSH,val);
if (ans) puts("No");
else puts("Yes");
}
}