bzoj hash+map+set

先对原串分组hash,查询就是看某一区间内是否出现某值.

可以每个值存一个集合,保存这个值出现的位置.(也可以建可持久化值域线段树)

map<int,set<int> >很省事...

(Yes写成了YES,狂WA)

#include <cstdio>
#include <map>
#include <set>
#define N 1000010
#define Mod 9999990000001LL
#define Base 100000007LL
using namespace std;

typedef unsigned long long dnt;

int n, m, k;
int buf[N];
map<dnt,set<int> > mst;

dnt hash( int *a ) {
    dnt rt=0;
    for( int i=0; i<k; i++ )
        rt = (rt*Base + a[i]) % Mod;
    return rt;
}
int main() {
    scanf( "%d%d%d", &n, &m, &k );
    for( int i=1; i<=n; i++ )
        scanf( "%d", buf+i );
    for( int i=1; i<=n; i++ ) {
        mst[hash(buf+i)].insert(i);
    }
    for( int t=1; t<=m; t++ ) {
        int l, r;
        scanf( "%d%d", &l, &r );
        for( int i=0; i<k; i++ )
            scanf( "%d", buf+i );
        r = r-k+1;
        dnt v = hash(buf);
        map<dnt,set<int> >::iterator it = mst.find(v);
        if( it==mst.end() || it->second.lower_bound(l)==it->second.upper_bound(r) )
            printf( "Yes
" );
        else
            printf( "No
" );
    }
}