POJ 1442 Black Box 堆

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

开始用二叉排序树写的，TLE了，改成优先队列，过了。。

两个版本都贴一下吧，赚稿费。。

 #include <stdio.h>
 #include <queue>
 #include <vector>
 using namespace std;
 priority_queue<int>qmax;
 priority_queue<int, vector<int>, greater<int> >qmin;

 int add[];

 int main()
 {
     int n, m, last = , get;
     scanf("%d %d", &n, &m);
     for(int i = ; i < n; i++)
         scanf("%d", &add[i]);
     for(int i = ; i <= m; i++)
     {
         scanf("%d", &get);
         while(last < get)
             qmax.push(add[last++]);
         while(qmax.size() >= i)
         {
             qmin.push(qmax.top());
             qmax.pop();
         }
         qmax.push(qmin.top());
         qmin.pop();
         printf("%d\n", qmax.top());
     }
     return ;
 }

优先队列AC

 #include <stdio.h>
 #include <stdlib.h>

 struct node
 {
     int data;
     struct node *left, *right;
 };
 int add[], cnt;

 void build(struct node *&p, int k)
 {
     if(p == NULL)
     {
         p = (struct node *)malloc(sizeof(struct node));
         p->data = k;
         p->left = p->right = NULL;
         return;
     }
     if(p->data >= k)
         build(p->left, k);
     else build(p->right, k);
 }

 void seek(struct node *p, int x)
 {
     if(p == NULL || cnt > x)return;
     seek(p->left, x);
     if(cnt++ == x)
         printf("%d\n", p->data);
     seek(p->right, x);
 }

 int main()
 {
     int n, m, last = , get;
     scanf("%d %d", &n, &m);
     struct node *root = NULL;
     for(int i = ; i < n; i++)
         scanf("%d", &add[i]);
     for(int i = ; i <= m; i++)
     {
         scanf("%d", &get);
         while(last < get)
             build(root, add[last++]);
         cnt = ;
         seek(root, i);
     }
     return ;
 }

二叉排序树TLE