【bzoj3207】花神的嘲讽计划Ⅰ hash

直接hash就好了，每次查询hash表里有没有在这个区间里的就可以，貌似并不用主席树。

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#define maxn 200010
#define mod 1000007

using namespace std;

int hash1[maxn];
unsigned long long hash2[maxn];
int a[maxn];
int b[maxn];
int p1[maxn];
unsigned long long p2[maxn];
int n,T,k;
vector<pair<unsigned long long,int> > v[mod];
int hash;
unsigned long long Hash;

bool check(int l,int r)
{
	for (int i=0;i<v[hash].size();i++)
	  if (v[hash][i].first==Hash && v[hash][i].second>=l && v[hash][i].second+k-1<=r) return 1;
	return 0;
}

int calc1(int l,int r)
{
	return ((long long)hash1[r]-(long long)hash1[l-1]*p1[r-l+1]%mod+mod)%mod;
}

unsigned long long calc2(int l,int r)
{
	return hash2[r]-hash2[l-1]*p2[r-l+1];
}

int main()
{
	scanf("%d%d%d",&n,&T,&k);
	for (int i=1;i<=n;i++) scanf("%d",&a[i]);
	p1[0]=1;p2[0]=1;
	for (int i=1;i<=n;i++) p1[i]=((long long)p1[i-1]*233333)%mod,p2[i]=p2[i-1]*10000007;
	for (int i=1;i<=n;i++) hash1[i]=((long long)hash1[i-1]*233333+a[i])%mod,hash2[i]=hash2[i-1]*10000007+a[i];
	for (int i=1;i+k-1<=n;i++) v[calc1(i,i+k-1)].push_back(make_pair(calc2(i,i+k-1),i));
	while (T--)
	{
		int l,r;
		scanf("%d%d",&l,&r);
		for (int j=1;j<=k;j++) scanf("%d",&b[j]);
		hash=0,Hash=0;
		for (int j=1;j<=k;j++) hash=((long long)hash*233333+b[j])%mod,Hash=Hash*10000007+b[j];
		if (check(l,r)) printf("No\n");
		else printf("Yes\n");
	}
	return 0;
}