treap..
有幾個(gè)地方寫(xiě)的很尷尬...
其實(shí)我沒(méi)寫(xiě)過(guò)平衡樹(shù)...任何的平衡樹(shù)..
所以我就把對(duì)于size的維護(hù)寫(xiě)錯(cuò)了..orz..
然后我又把砍掉一棵子樹(shù)那部分寫(xiě)錯(cuò)了..
我感覺(jué)這樣砍樹(shù)是會(huì)造成一定的不平衡的..
但不平衡會(huì)很小.
呃..其實(shí)也不能這么說(shuō)..
應(yīng)該說(shuō)..會(huì)造成不平衡..
但這個(gè)不平衡帶給我的負(fù)擔(dān)不會(huì)高于我曾經(jīng)的負(fù)擔(dān)..orz..貌似是這樣
#include <iostream>
#include <fstream>
#include <stdio.h>
using namespace std;
#define RANK_L(x) ((x)->left==NULL?0:(x)->left->size)
#define RANK_R(x) ((x)->right==NULL?0:(x)->right->size)
ifstream fin("cashier.in");
ofstream fout("cashier.out");
int delta=0,leave=0;
const int MAXN=100001;
int num=0;
struct node
{
int father,size,value,ran;
node *left,*right;
} *root,tree[MAXN+1];
int n,m_in;
int len=0;
int _count=0;
/**//*
a
/ \
c b
/ \
d e
*/
void RotateLeft(node* &x)
{
node *z=x->right;
z->size=x->size;
x->right=z->left;
z->left=x;
x->size=RANK_L(x)+RANK_R(x)+1;
x=z;
}
void RotateRight(node* &x)
{
node *z=x->left;
z->size=x->size;
x->left=z->right;
z->right=x;
x->size=RANK_R(x)+RANK_L(x)+1;
x=z;
}
void insert(node *&x,int k)
{
if (x==NULL)
{
node *p=&tree[len++];
p->value=k;
p->ran=rand()*rand();
p->size=1;
p->left=NULL;
p->right=NULL;
x=p;
return;
}
x->size++;
if (k>=x->value)
{
insert(x->right,k);
if (x->right->ran>x->ran) RotateLeft(x);
}
else
{
insert(x->left,k);
if (x->left->ran>x->ran) RotateRight(x);
}
}
int _delete(node *&x)
{
int v=0,t=0;
if (x==NULL) return 0;
if (x->value+delta<m_in)
{
v+=RANK_L(x)+1;
x->size-=v;
x->left=NULL;
t=_delete(x->right);
v+=t;
x->size-=t;
if (x->right!=NULL) x->right->size=x->size;
x=x->right;
}
else
{
t=_delete(x->left);
v=t;
x->size-=t;
}
return v;
}
int find(node *x,int k)
{
if (x==NULL) return 0;
if (k==RANK_R(x)+1) return x->value;
if (k>RANK_R(x)) return find(x->left,k-RANK_R(x)-1);
else
return find(x->right,k);
}
int total;
int main()
{
root=NULL;
fin>>n>>m_in;
for (int i=1;i<=n;i++)
{
char c,ch;
int k;
fin>>c>>k;
switch(c)
{
case 'I':if (k>=m_in) {total++;insert(root,k-delta);}break;
case 'A':delta+=k;break;
case 'S':delta-=k;_count=_delete(root);num+=_count;break;
case 'F':if (k>total-num) fout<<-1<<endl; else fout<<find(root,k)+delta<<endl;break;
default:break;
}
}
fout<<num<<endl;
return 0;
}