UVa 1402 Runtime Error 伸展树

Runtime Error 到现在连样例也跑不出来！！！

调试了一晚上快要死了……

知道错在哪里但是不会改，代码先扔在这里吧。看来不能太依赖模板啊orz……

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

using namespace std;

struct Node
{
    Node *ch[2];
    int v;         //节点编号
    int s;         //节点域
    int flip;
    Node( int v ):v(v)
    {
        ch[0] = ch[1] = NULL;
        s = 1;
        flip = 0;
    }
    int cmp( int x ) const
    {
        int t = ( ch[0] == NULL ) ? 0 : ch[0]->s;
        if ( t >= x ) return 0;
        if ( t + 1 == x ) return -1;
        return 1;
    }
    void maintain()
    {
        s = 1;
        if ( ch[0] != NULL ) s += ch[0]->s;
        if ( ch[1] != NULL ) s += ch[1]->s;
        return;
    }
    void pushDown()
    {
        if ( flip )
        {
            flip = 0;
            swap( ch[0], ch[1] );
            if ( ch[0] != NULL ) ch[0]->flip = !ch[0]->flip;
            if ( ch[1] != NULL ) ch[1]->flip = !ch[1]->flip;
        }
    }
};

struct number
{
    int val;
    int i;
};

const int MAXN = 100010;

int n;
number num[MAXN];
int SA[MAXN];

void Rotate( Node* &o, int d )   //d=0 左旋  d=1 右旋
{
    Node *k = o->ch[ d ^ 1 ];
    o->ch[ d ^ 1 ] = k->ch[d];
    k->ch[d] = o;
    o = k;
    o->ch[d]->maintain();
    o->maintain();
    return;
}

void splay( Node* &o, int k )
{
    o->pushDown();
    int d = o->cmp(k);
    if ( d == 1 )
    {
        if ( o->ch[0] != NULL )
            k -= o->ch[0]->s;
        --k;
    }
    if ( d != -1 )
    {
        Node *p = o->ch[d];
        p->pushDown();
        int d2 = p->cmp(k);
        int k2 = k;
        if ( d2 == 1 )
        {
            if ( p->ch[0] != NULL )
                k2 -= p->ch[0]->s;
            --k2;
        }
        if ( d2 != -1 )
        {
            splay( p->ch[d2], k2 );
            if ( d == d2 ) Rotate( o, d ^ 1 );
            else Rotate( o->ch[d], d );
        }
        Rotate( o, d ^ 1 );
    }
    return;
}

void build( Node* &o, int l, int r )
{
    int m = ( l + r ) >> 1;

    o = new Node( m );
    if ( l < m ) build( o->ch[0], l, m - 1 );
    if ( r > m ) build( o->ch[1], m + 1, r );
    o->maintain();

    return;
}

void DFS( Node *cur )
{
    cur->pushDown();
    if ( cur->ch[0] ) DFS( cur->ch[0] );
    //if ( cur->v && cur->v != n + 1 )
    printf( "num=%d id=%d
", SA[cur->v], cur->v );
    if ( cur->ch[1] ) DFS( cur->ch[1] );
    return;
}

bool cmp( number a, number b )
{
    if ( a.val == b.val ) return a.i < b.i;
    return a.val < b.val;
}

int Search( Node *o, int x )
{
    int res = 0;
    while ( o != NULL )
    {
        o->pushDown();
        int d;
        if ( x == o->v ) d = -1;
        else if ( x < o->v ) d = 0;
        else d = 1;

        printf("search=%d
", o->v );

        if ( d == -1 )
        {
            if ( o->ch[0] != NULL )
                res += o->ch[0]->s;
            ++res;
            return res;
        }
        else
        {
            if ( o->v == 5 && x == 2 )
            {
                printf("%d
", o->ch[1]->v );
                puts("@@@");
            }
            if ( d == 1 )
            {
                if ( o->ch[0] != NULL )
                    res += o->ch[0]->s;
                ++res;
            }
            o = o->ch[d];
        }
    }
    return -1;
}

Node *root;

Node *Merge( Node *left, Node *right )
{
    splay( left, left->s );
    left->ch[1] = right;
    left->maintain();
    return left;
}

void RemoveRoot()
{
    Node *tmp = root;
    root = Merge( root->ch[0], root->ch[1] );
    delete tmp;
    return;
}

int main()
{
    while ( scanf( "%d", &n ), n )
    {
        for ( int i = 1; i <= n; ++i )
        {
            scanf("%d", &num[i].val );
            num[i].i = i;
        }

        root = NULL;
        build( root, 1, n );
        sort( num + 1, num + n + 1, cmp );

        for ( int i = 1; i <= n; ++i ) SA[ num[i].i ] = num[i].val;
        //DFS( root );
        for ( int i = 1; i <= n; ++i )
        {
            int id = Search( root, num[i].i );
            printf( "num = %d %d %d
", num[i].val, num[i].i, id );
            splay( root, id );
            DFS(root);
            if ( i ) putchar(' ');

            int tmp;
            if ( root->ch[0] ) tmp = i + root->ch[0]->s;
            else tmp = i;
            printf( "%d

", tmp );

            root->ch[0]->flip ^= 1;

            RemoveRoot();
        }
        puts("");
    }
    return 0;
}