POJ 1442 Black Box（Treap模板题）

题目链接：http://poj.org/problem?id=1442

题目大意：

就讲一下第二行数列到底是什么玩意儿吧，第二行的意思是插入第几个数的时候进行一次询问，第一次询问排第一，第二次询问排第二的...

解题思路：

Treap模板题，所以我另写了一篇博客把这题需要的部分讲了一下：对，对，就是这里

代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>

using namespace std;

#define for1(i,a,b) for (int i=a;i<=b;i++)
#define for0(i,a,b) for (int i=a;i<b;i++)

const int N = 3e4+5;

int a[N],qq[N];

struct Treap
{
    Treap* ch[2];
    int val;
    int pri;
    int cnt;

    Treap(int x){ch[0] = ch[1] = NULL; pri = rand(); val = x;cnt = 1;}

    void maintain(){
        cnt = 1;
        if (ch[0]!=NULL) cnt += ch[0]->cnt;
        if (ch[1]!=NULL) cnt += ch[1]->cnt;
    }
};

void rotate(Treap* &rt,int d)///注意&
{
    Treap* k = rt->ch[d^1];
    rt->ch[d^1] = k->ch[d];
    k->ch[d] = rt;
    rt->maintain();
    k->maintain();
    rt = k;
}

void insert(Treap* &rt,int x)///注意&
{
    if (rt==NULL){rt = new Treap(x);}
    else {
        int d = (x < rt->val)? 0:1 ;
        insert(rt->ch[d],x);
        if (rt->ch[d]->pri > rt->pri) rotate(rt,d^1);
    }
    rt->maintain();
}

int ccnt;
int find(Treap* rt,int k)
{
    if (rt->ch[0]==NULL) ccnt = 1;
    else ccnt = 1 + rt->ch[0]->cnt;
    if (k==ccnt) return rt->val;
    else if (k<ccnt) return find(rt->ch[0],k);
    else return find(rt->ch[1],k-ccnt);
}

int main()
{
    int n,q;
    int x;
    Treap *root=NULL;
    scanf("%d %d",&n,&q);
    for1(i,1,n) scanf("%d",a+i);
    for1(i,1,q) scanf("%d",qq+i);

    int tot = 0;
    int now = 0;

    for1(i,1,n){
        insert(root,a[i]);
        while (qq[now+1] == i) printf("%d\n",find(root,++tot)),now++;
    }
    return 0;
}