poj 2823 Sliding Window treap/segtree

原题链接：http://poj.org/problem?id=2823
题意很简单，就不多说了。
我用平衡树写的，代码效率不高，太慢了几乎卡着评测时间过的，gcc tle，c过了。纯当练习treap。
貌似可以用单调队列来做，偶还不太熟悉，等会了以后再慢慢补上。
代码如下：

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define Max_N 1000010
#define size(_) ((_)==NULL ? 0 : (_)->size)
#define _size(_) (size((_)->ch[0]) + size((_)->ch[1]) + (_)->cnt)
typedef struct _treap{
    int val, fix, cnt, size;
    struct _treap *ch[2];
}treap, *Treap;
treap stack[Max_N];
int sz, ret[Max_N], min[Max_N], max[Max_N];
int _random(){
    static int x = 1840828537;
    x += (x << 2) | 1;
    return x;
}
void rotate(Treap *x, int d){
    Treap k = (*x)->ch[!d];
    (*x)->ch[!d] = k->ch[d];
    k->ch[d] = *x;
    (*x)->size = _size(*x);
    k->size = _size(k);
    *x = k;
}
void insert(Treap *x, int val){
    int d = 0;
    if (*x == NULL){
        *x = &stack[sz++];
        (*x)->ch[0] = (*x)->ch[1] = NULL;
        (*x)->size = (*x)->cnt = 1, (*x)->val = val, (*x)->fix = _random();
    } else if (val != (*x)->val){
        d = val > (*x)->val;
        insert(&((*x)->ch[d]), val);
        if ((*x)->ch[d]->fix < (*x)->fix) rotate(x, !d);
        (*x)->size = _size(*x);
    } else {
        (*x)->cnt++, (*x)->size++;
    }
}
void _delete(Treap *x, int val){
    int d = 0;
    if ((*x)->val == val){
        if ((*x)->cnt>1){
            (*x)->size--, (*x)->cnt--;
        } else {
            if ((*x)->ch[0] == NULL || (*x)->ch[1] == NULL){
                (*x) = ((*x)->ch[0] != NULL ? (*x)->ch[0] : (*x)->ch[1]);
            } else {
                d = (*x)->ch[0]->fix < (*x)->ch[1]->fix;
                rotate(x, !d);
                (*x)->size--;
                _delete(&((*x)->ch[!d]), val);
            }
        }
    } else {
        d = val > (*x)->val;
        (*x)->size--;
        _delete(&((*x)->ch[d]), val);
    }
}
int find_kth(Treap x, int k){
    int t = 0;
    for (; x != NULL;){
        t = size(x->ch[0]);
        if (t + 1 <= k && k <= t + x->cnt) break;
        else if (k < t + 1) x = x->ch[0];
        else k -= t + x->cnt, x = x->ch[1];
    }
    return x->val;
}
int main(){
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w+", stdout);
#endif
    int i, d, n, k;
    Treap root = NULL;
    while (~scanf("%d %d", &n, &k)){
        d =  sz = 0, root = NULL;
        for (i = 0; i <= n; i++){
            if (i != n)scanf("%d", &ret[i]);
            if (i < k){
                insert(&root, ret[i]);
            } else {
                max[d] = find_kth(root, root->size);
                min[d] = find_kth(root, 1);
                _delete(&root, ret[d++]);
                insert(&root, ret[i]);
            }
        }
        for (i = 0; i < d; i++){
            printf("%d", min[i]);
            if (i < d - 1) printf(" ");
        }
        printf("\n");
        for (i = 0; i < d; i++){
            printf("%d", max[i]);
            if (i < d - 1) printf(" ");
        }
        printf("\n");
    }
    return 0;
}

用线段树写了一下，还是慢/(ㄒoㄒ)/~~

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define Max_N 1000010
#define INF 0x7fffffff
#define _max(a,b) ((a)>(b)?(a):(b))
#define _min(a,b) ((a)>(b)?(b):(a))
typedef struct _seg{
    int min, max;
}SegTree;
SegTree seg[3000000];
int ret[Max_N], min[Max_N], max[Max_N];
void built(int root, int l, int r){
    if (l == r){
        seg[root].min = seg[root].max = ret[l];
        return;
    } else {
        int mid = (l + r) >> 1;
        built(root << 1, l, mid);
        built(root << 1 | 1, mid + 1, r);
        seg[root].max = _max(seg[root << 1].max, seg[root << 1 | 1].max);
        seg[root].min = _min(seg[root << 1].min, seg[root << 1 | 1].min);
    }
}
int query(int root, int _x, int _y, int x, int y, int d){
    int mid, v1, v2;
    if (x > _y || y < _x) return (d == 0 ? INF : -INF);
    if (x <= _x && y >= _y) return (d == 0 ? seg[root].min : seg[root].max);
    mid = (_x + _y) >> 1;
    v1 = query(root << 1, _x, mid, x, y, d);
    v2 = query(root << 1 | 1, mid + 1, _y, x, y, d);
    return (d == 0 ? _min(v1, v2) : _max(v1, v2));
}
int main(){
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w+", stdout);
#endif
    int i, d, n, k;
    while (~scanf("%d %d", &n, &k)){
        for (i = 1; i <= n; i++) scanf("%d", &ret[i]);
        d = 0, built(1, 1, n);
        for (i = 0; i + k <= n; i++){
            min[d] = query(1, 1, n, i + 1, i + k, 0);
            max[d++] = query(1, 1, n, i + 1, i + k, 1);
        }
        for (i = 0; i < d; i++){
            printf("%d", min[i]);
            if (i < d - 1) printf(" ");
        }
        printf("\n");
        for (i = 0; i < d; i++){
            printf("%d", max[i]);
            if (i < d - 1) printf(" ");
        }
        printf("\n");
    }
    return 0;
}