POJ 1442 Black Box（【Treap】求动态区间第k大）

题目链接：http://poj.org/problem?id=1442
Black Box
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 13493 Accepted: 5492
Description

Our Black Box represents a primitive database. It can save an integer array and has a special i variable. At the initial moment Black Box is empty and i equals 0. This Black Box processes a sequence of commands (transactions). There are two types of transactions:

ADD (x): put element x into Black Box;
GET: increase i by 1 and give an i-minimum out of all integers containing in the Black Box. Keep in mind that i-minimum is a number located at i-th place after Black Box elements sorting by non- descending.

Let us examine a possible sequence of 11 transactions:

Example 1

N Transaction i Black Box contents after transaction Answer

  (elements are arranged by non-descending)   

1 ADD(3) 0 3

2 GET 1 3 3

3 ADD(1) 1 1, 3

4 GET 2 1, 3 3

5 ADD(-4) 2 -4, 1, 3

6 ADD(2) 2 -4, 1, 2, 3

7 ADD(8) 2 -4, 1, 2, 3, 8

8 ADD(-1000) 2 -1000, -4, 1, 2, 3, 8

9 GET 3 -1000, -4, 1, 2, 3, 8 1

10 GET 4 -1000, -4, 1, 2, 3, 8 2

11 ADD(2) 4 -1000, -4, 1, 2, 2, 3, 8

It is required to work out an efficient algorithm which treats a given sequence of transactions. The maximum number of ADD and GET transactions: 30000 of each type.

Let us describe the sequence of transactions by two integer arrays:

1. A(1), A(2), …, A(M): a sequence of elements which are being included into Black Box. A values are integers not exceeding 2 000 000 000 by their absolute value, M <= 30000. For the Example we have A=(3, 1, -4, 2, 8, -1000, 2).

2. u(1), u(2), …, u(N): a sequence setting a number of elements which are being included into Black Box at the moment of first, second, … and N-transaction GET. For the Example we have u=(1, 2, 6, 6).

The Black Box algorithm supposes that natural number sequence u(1), u(2), …, u(N) is sorted in non-descending order, N <= M and for each p (1 <= p <= N) an inequality p <= u(p) <= M is valid. It follows from the fact that for the p-element of our u sequence we perform a GET transaction giving p-minimum number from our A(1), A(2), …, A(u(p)) sequence.

Input

Input contains (in given order): M, N, A(1), A(2), …, A(M), u(1), u(2), …, u(N). All numbers are divided by spaces and (or) carriage return characters.
Output

Write to the output Black Box answers sequence for a given sequence of transactions, one number each line.
Sample Input

7 4
3 1 -4 2 8 -1000 2
1 2 6 6
Sample Output

3
3
1
2
Source

Northeastern Europe 1996
【中文题意】
首先给你两个整数n和m。n代表需要加入序列的元素的个数。
m代表查询的次数。
下面一行n个整数，代表要加入序列的数。
下面一行m个整数，代表m次查询操作，第i 次查询操作要输入一个值X。代表加入序列X的数后的序列中的第i大的数是哪个。
【思路分析】
就是利用Treap的特性来快速查询第k大的数是哪个，非常裸的题目，需要注意一点，在POJ上尽量不要使用运算符的重载，要不可能会超时超到死。
【AC代码】

#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
using namespace std;

struct Node
{
    Node *ch[2];//左右子树
    int r;//随机优先级
    int v;//该点的值
    int s;//该点的节点总数
    Node(int v):v(v)
    {
        ch[0]=ch[1]=NULL;//左右子树初始化为空
        r=rand();//优先级随机
        s=1;//只有本身一个结点
    }
    bool operator <(const Node &rhs)const
    {
        return r<rhs.r;
    }
    int cmp(int x)const
    {
        if(x==v)return -1;
        return x<v?0:1;//0代表左边，1代表右边
    }
    void maintain()//更新结点域
    {
        s=1;
        if(ch[0]!=NULL)s+=ch[0]->s;
        if(ch[1]!=NULL)s+=ch[1]->s;
    }
};
void rotate(Node* &o,int d)//对o结点进行旋转，0代表左旋，1代表右旋，旋转后更新结点域
{
    Node *k=o->ch[d^1];
    o->ch[d^1]=k->ch[d];
    k->ch[d]=o;
    o->maintain();
    k->maintain();
    o=k;
}
void insert(Node* &o,int x)//插入一个值为x的结点
{
    if(o==NULL)o=new Node(x);
    else
    {
        int d=(x<o->v?0:1);//x< o->v 时d=0该节点被插入左边，否则d=1插入右边
        insert(o->ch[d],x);
        if(o->ch[d]->r>o->r)rotate(o,d^1);//如果被插入后优先级比父节点大，要发生旋转
    }
    o->maintain();
}
void remove(Node* &o,int x)//删除一个值为x的节点
{
    int d=o->cmp(x);
    if(d==-1)//d==1时代表代表需删除的节点为当前节点
    {
        Node* u=o;
        if(o->ch[0]!=NULL&&o->ch[1]!=NULL)//左右孩子非空
        {
            int d2=(o->ch[0] > o->ch[1] ?1:0);//左孩子与右孩子谁的优先级比较高
            rotate(o,d2);//谁的高向另外的方向旋转
            remove(o->ch[d2],x);//旋转后删除x节点
        }
        else
        {
            if(o->ch[0]==NULL)o=o->ch[1];//左孩子为空，o指向右孩子
            else o=o->ch[0];//否则指向左孩子
            delete u;
        }
    }
    else
        remove(o->ch[d],x);
    if(o!=NULL)o->maintain();//删除后o有孩子的话更新结点域
}

const int maxc = 500000 + 10;
struct Command
{
    char type;
    int x,p;
} commands[maxc]; //记录要执行的命令


Node *root;//Treap

int kth(Node* o,int k)//查找以o为根节点的子树中的第k大
{
    if(o==NULL || k <= 0 ||k > o->s)return 0;//不合法情况
    int s = (o->ch[1] == NULL ? 0 : o->ch[1]->s);
    if(k==s+1)return o->v;//正好第k大为当前节点
    else if(k<=s)
    {
        return kth(o->ch[1],k);//第k大在右子树上
    }
    else return kth(o->ch[0],k-s-1);//第k大在左子树上
}

const int maxn = 30000+10;
int n,m,a[maxn];

int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        root=NULL;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
        }
        int cnt=1,x;
        for(int i=1;i<=m;i++)
        {
            scanf("%d",&x);
            while(cnt<=x)
            {
                insert(root,a[cnt]);
                cnt++;
            }
            printf("%d\n",kth(root,cnt-i));
        }
    }
    return 0;
}