BZOJ 3207 花神的嘲讽计划Ⅰ 可持久化线段树-CSDN博客

本文链接：https://blog.csdn.net/huanghongxun/article/details/50448560

给出一个序列，对于每个询问，求询问序列是否在原序列某区间内出现过。

由于询问序列长度均为K，所以原序列可以hash成n-k+1个数，那么问题就转化为给出一个数，问在序列某区间内是否出现过。

这种问题需要可持久化线段树。

离散化写的我心碎。。

#include <cstdio>
#include <algorithm>
#include <map>
#define FOR(i,j,k) for(i=j;i<=k;i++)
#define N 500001
typedef long long ll;
using namespace std;
  
struct SegTree {
    int s;
    SegTree *lc, *rc;
    SegTree() { lc = rc = this; }
    SegTree(SegTree *_lc, SegTree *_rc, int _s) : lc(_lc), rc(_rc), s(_s) {}
    void* operator new(size_t) {
        static SegTree pool[N * 16], *pointer = pool;
        return pointer++;
    }

    static SegTree *insert(SegTree *o, int l, int r, int y) {
        if (l == r) return new SegTree(o->lc, o->rc, o->s + 1);
        int m = l + r >> 1;
        if (y <= m) return new SegTree(insert(o->lc, l, m, y), o->rc, o->s + 1);
        else return new SegTree(o->lc, insert(o->rc, m + 1, r, y), o->s + 1);
    }

    static int contains(SegTree *lx, SegTree *rx, int l, int r, int y) {
        if (l == r) return rx->s - lx->s;
        int m = l + r >> 1;
        if (y <= m) return contains(lx->lc, rx->lc, l, m, y);
        else return contains(lx->rc, rx->rc, m + 1, r, y);
    }
} *root[N];

map<ll, int> mp;
ll h[N] = {0}, hash[N];
int num[N], key[N];
bool cmp(int x, int y) { return hash[x] < hash[y]; }
int main() {
    int i, j, l, r, x, m, n, k, sum = 1;
    scanf("%d%d%d", &n, &m, &k);
    FOR(i,1,n) scanf("%d", &key[i]), h[i] = h[i - 1] * 107 + key[i];
    ll z = 1; FOR(i,1,k) z *= 107;
    n = n - k + 1;
    FOR(i,1,n) hash[i] = h[i + k - 1] - h[i - 1] * z, num[i] = i;
    sort(num + 1, num + n + 1, cmp);
    FOR(i,1,n) key[i] = sum += (hash[num[i]] != hash[num[i - 1]]);
    FOR(i,1,n) mp[hash[i]] = key[i];
    root[0] = new SegTree();
    FOR(i,1,n) root[i] = SegTree::insert(root[i - 1], 1, sum, key[i]);
    while (m--) {
        scanf("%d%d", &l, &r);
        if (r > n) r = n;
        ll ha = 0;
        FOR(i,1,k) scanf("%d", &x), ha = ha * 107 + x;
        map<ll, int>::iterator p = mp.find(ha);
        if (p == mp.end()) puts("Yes");
        else puts(SegTree::contains(root[l - 1], root[r], 1, sum, p->second) ? "No" : "Yes");
    }
    return 0;
}