Treap模板

/*************************************************************************
    > File Name: D.cpp
    > Author: Stomach_ache
    > Mail: sudaweitong@gmail.com
    > Created Time: 2014年10月03日 星期五 14时55分53秒
    > Propose: 
 ************************************************************************/
#include <cmath>
#include <ctime>
#include <string>
#include <cstdio>
#include <vector>
#include <fstream>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
/*Let's fight!!!*/

typedef struct TreeNode* pTree;
pTree null, root;
struct TreeNode {
    int value, size, prior;
    //======
    int ans, Lval, Rval;
    //======
    pTree lch, rch;
    TreeNode() : value(0), size(0) {
          lch = rch = NULL;
    }
    TreeNode(int val);
};

TreeNode::TreeNode(int val) : value(val), size(1) {
    lch = rch = NULL;
    prior = rand() % 1000000000 + 1;
    Lval = Rval = val;
    ans = 1;
}

int GetRightValue(pTree t) {
    ｉf (!t->rch) return t->value;
    return GetRightValue(t->rch);
}

int GetLeftValue(pTree t) {
    if (!t->lch) return t->value;
    return GetLeftValue(t->lch);
}

int GetSize(pTree t) {
      if (!t) return 0;
      return t->size;
}

int GetAns(pTree t) {
    if (!t) return 0;
    return t->ans;
}

void pushUp(pTree t) {
    if (!t) return ;
    t->size = 1 + GetSize(t->lch) + GetSize(t->rch);
    if (t->lch) 
        t->Lval = t->lch->Lval;
    else 
        t->Lval = t->value;
    if (t->rch)
          t->Rval = t->rch->Rval;
    else 
          t->Rval = t->value;

    t->ans = 1 + GetAns(t->lch) + GetAns(t->rch);
    if (t->lch && t->value == t->lch->Rval) t->ans--;
    if (t->rch && t->value == t->rch->Lval) t->ans--;
}

void Split(pTree t, pTree &l, pTree &r, int key, int add = 0) {
    if (!t) {
        l = r = NULL;
        return ;
    }

    int cur_add = add + GetSize(t->lch);
    if (cur_add >= key) Split(t->lch, l, t->lch, key, add), r = t;
    else Split(t->rch, t->rch, r, key, add + GetSize(t->lch) + 1), l = t;
    pushUp(l);
    pushUp(r);
}

void Merge(pTree &t, pTree l, pTree r) {
      // Merge two subtree
    pushUp(l);
    pushUp(r);
    if (!l|| !r) {
          t = l ? l : r;
        return ;
    }

    if (l->prior > r->prior) Merge(l->rch, l->rch, r), t = l;
    else Merge(r->lch, l, r->lch), t = r;
    pushUp(t);
}

void insert(pTree &t, int val) {
    pTree tmp = new TreeNode(val);
    Merge(t, t, tmp);
}

void write(pTree t) {
      if (!t) return ;
    write(t->lch);
    cout << t->value << " ";
    write(t->rch);
}

int get(pTree root, int l, int r) {
      pTree t1, t2, t3;
    // spliting tree in three segments t1, t2, t3;
    Split(root, t1, t3, r);
    Split(t1, t1, t2, l - 1);
    // t2 = segment from l to r
    int ret = t2->ans;
    // get back to start position
    Merge(t1, t1, t2);
    Merge(root, t1, t3);
    return ret;
}

void replacing(pTree &root, int l, int r) {
      pTree t1, t2, t3;
    // spliting tree in three segments t1, t2, t3
    Split(root, t1, t3, r);
    Split(t1, t1, t2, l - 1);
    // merging them in this order: t2, t1, t3
    Merge(t1, t2, t1);
    Merge(root, t1, t3);
}

void read(int &res) {
    res = 0;
    char c = ' ';
    while (c < '0' || c > '9') c = getchar();
    while (c >= '0' && c <= '9') res = (res<<3) + (res<<1) + c - '0', c = getchar();
}

int main(void) {
      srand(time(0));
    //null = new TreeNode();
    //null->lch = null->rch = null;
    //null->size = null->value = 0;

    ios::sync_with_stdio(false);
    int tcase;
    read(tcase);
    while (tcase--) {
          root = NULL;
          int N, M, val, op, l, r;
        read(N);
        for (int i = 1; i <= N; i++) {
              read(val);
            insert(root, val);
        }
        read(M);
        while (M--) {
              read(op), read(l), read(r);
            if (op == 1) {
                  int res = get(root, l, r);
                cout << res << endl;
            } else {
                  replacing(root, l, r);
            }
        }
    }

    return 0;
}