普通平衡树
一道平衡树模板题
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+10,INF=1e8;
struct node
{
int l,r;
int key,val;
int cnt;
int size;
}tr[N];
int root,idx;
void pushup(int p)
{
tr[p].size=tr[tr[p].l].size+tr[tr[p].r].size+tr[p].cnt;
}
int get_node(int key)
{
tr[++idx].key=key;
tr[idx].val=rand();
tr[idx].cnt=tr[idx].size=1;
return idx;
}
void zig(int &p) // 右旋
{
int q = tr[p].l;
tr[p].l = tr[q].r, tr[q].r = p, p = q;
pushup(tr[p].r), pushup(p);
}
void zag(int &p) // 左旋
{
int q = tr[p].r;
tr[p].r = tr[q].l, tr[q].l = p, p = q;
pushup(tr[p].l), pushup(p);
}
void build()
{
get_node(-INF),get_node(INF);
root=1,tr[1].r=2;
pushup(1);
if (tr[1].val < tr[2].val) zag(root);
}
void insert(int &p,int key)
{
if(!p) p=get_node(key);
else if(tr[p].key==key) tr[p].cnt++;
else if(tr[p].key>key)
{
insert(tr[p].l,key);
if(tr[tr[p].l].val>tr[p].val) zig(p);
}
else
{
insert(tr[p].r,key);
if(tr[tr[p].r].val>tr[p].val) zag(p);
}
pushup(p);
}
void remove(int &p,int key)
{
if(!p) return;
if(tr[p].key==key)
{
if(tr[p].cnt>1) tr[p].cnt--;
else if(tr[p].l||tr[p].r)
{
if(!tr[p].r||tr[tr[p].l].val>tr[tr[p].r].val)
{
zig(p);
remove(tr[p].r,key);
}
else
{
zag(p);
remove(tr[p].l,key);
}
}
else p=0;
}
else if(tr[p].key>key) remove(tr[p].l,key);
else remove(tr[p].r,key);
pushup(p);
}
int get_rank_by_key(int &p,int key)
{
if(!p) return 0;
if(tr[p].key==key) return tr[tr[p].l].size+1;
if(tr[p].key>key) return get_rank_by_key(tr[p].l,key);
return tr[tr[p].l].size+tr[p].cnt+get_rank_by_key(tr[p].r,key);
}
int get_key_by_rank(int &p,int rank)
{
if(!p) return 0;
if(tr[tr[p].l].size>=rank) return get_key_by_rank(tr[p].l,rank);
if(tr[tr[p].l].size+tr[p].cnt>=rank) return tr[p].key;
return get_key_by_rank(tr[p].r,rank-(tr[tr[p].l].size+tr[p].cnt));
}
int get_prev(int &p,int key)
{
if(!p) return -INF;
if(tr[p].key>=key) return get_prev(tr[p].l,key);
return max(tr[p].key,get_prev(tr[p].r,key));
}
int get_next(int &p,int key)
{
if(!p) return INF;
if(tr[p].key<=key) return get_next(tr[p].r,key);
return min(tr[p].key,get_next(tr[p].l,key));
}
int main()
{
int n;
scanf("%d",&n);
build();
while(n--)
{
int op,x;
scanf("%d%d",&op,&x);
if(op==1) insert(root,x);
else if(op==2) remove(root,x);
else if(op==3) printf("%d\n",get_rank_by_key(root,x)-1);
else if(op==4) printf("%d\n",get_key_by_rank(root,x+1));
else if(op==5) printf("%d\n",get_prev(root,x));
else printf("%d\n",get_next(root,x));
}
return 0;
}
营业额统计
就这道题来说,不必要使用平衡树来解决
用这道题练习平衡树
简单分析一下会发现这道题一点不难,只需要用平衡树支持三个操作就可以
- 插入一个数
- 找小于这个数的最大数
- 找大于这个数的最小数
由此就可以用上面的模板来解决这道题了
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 4e4, INF = 1e8;
int n;
struct Node
{
int l, r;
int key, val;
} tr[N];
int root, idx;
int get_node(int key)
{
tr[++idx].key = key;
tr[idx].val = rand();
return idx;
}
void build()
{
get_node(-INF), get_node(INF);
root = 1, tr[1].r = 2;
}
void zig(int &p)
{
int q = tr[p].l;
tr[p].l = tr[q].r, tr[q].r = p, p = q;
}
void zag(int &p)
{
int q = tr[p].r;
tr[p].r = tr[q].l, tr[q].l = p, p = q;
}
void insert(int &p, int key)
{
if (!p)
p = get_node(key);
else if (tr[p].key == key)
return;
else if (tr[p].key > key)
{
insert(tr[p].l, key);
if (tr[tr[p].l].val > tr[p].val)
zig(p);
}
else
{
insert(tr[p].r, key);
if (tr[tr[p].r].val > tr[p].val)
zag(p);
}
}
int get_prev(int p, int key)
{
if (!p)
return -INF;
if (tr[p].key > key)
return get_prev(tr[p].l, key);
return max(tr[p].key, get_prev(tr[p].r, key));
}
int get_next(int p, int key)
{
if (!p)
return INF;
if (tr[p].key < key)
return get_next(tr[p].r, key);
return min(tr[p].key, get_next(tr[p].l, key));
}
int main()
{
build();
scanf("%d", &n);
ll res = 0;
for (int i = 0; i < n; i++)
{
int x;
scanf("%d", &x);
if (i == 0)
res += x;
else
res += min(x - get_prev(root, x), get_next(root, x) - x);
insert(root, x);
}
printf("%lld\n", res);
return 0;
}
宠物收养所
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+10,INF=2e8,MOD=1e6;
struct node
{
int l,r;
int key,val;
int cnt;
int size;
}tr[N];
int root,idx;
void pushup(int p)
{
tr[p].size=tr[tr[p].l].size+tr[tr[p].r].size+tr[p].cnt;
}
int get_node(int key)
{
tr[++idx].key=key;
tr[idx].val=rand();
tr[idx].cnt=tr[idx].size=1;
return idx;
}
void zig(int &p) // 右旋
{
int q = tr[p].l;
tr[p].l = tr[q].r, tr[q].r = p, p = q;
pushup(tr[p].r), pushup(p);
}
void zag(int &p) // 左旋
{
int q = tr[p].r;
tr[p].r = tr[q].l, tr[q].l = p, p = q;
pushup(tr[p].l), pushup(p);
}
void build()
{
get_node(-INF),get_node(INF);
root=1,tr[1].r=2;
pushup(1);
if (tr[1].val < tr[2].val) zag(root);
}
void insert(int &p,int key)
{
if(!p) p=get_node(key);
else if(tr[p].key==key) tr[p].cnt++;
else if(tr[p].key>key)
{
insert(tr[p].l,key);
if(tr[tr[p].l].val>tr[p].val) zig(p);
}
else
{
insert(tr[p].r,key);
if(tr[tr[p].r].val>tr[p].val) zag(p);
}
pushup(p);
}
void remove(int &p,int key)
{
if(!p) return;
if(tr[p].key==key)
{
if(tr[p].cnt>1) tr[p].cnt--;
else if(tr[p].l||tr[p].r)
{
if(!tr[p].r||tr[tr[p].l].val>tr[tr[p].r].val)
{
zig(p);
remove(tr[p].r,key);
}
else
{
zag(p);
remove(tr[p].l,key);
}
}
else p=0;
}
else if(tr[p].key>key) remove(tr[p].l,key);
else remove(tr[p].r,key);
pushup(p);
}
int get_prev(int &p,int key)
{
if(!p) return -INF;
if(tr[p].key>=key) return get_prev(tr[p].l,key);
return max(tr[p].key,get_prev(tr[p].r,key));
}
int get_next(int &p,int key)
{
if(!p) return INF;
if(tr[p].key<=key) return get_next(tr[p].r,key);
return min(tr[p].key,get_next(tr[p].l,key));
}
int main()
{
int n;
int res=0;
int mark=0;
scanf("%d",&n);
build();
while(n--)
{
int op,x;
scanf("%d%d",&op,&x);
if(op==mark||tr[root].size==2)
{
mark=op;
insert(root,x);
}
else
{
int f=get_prev(root,x);
int e=get_next(root,x);
if(abs(f-x)>abs(e-x))
{
remove(root,e);
res=(res+abs(e-x))%MOD;
}
else
{
remove(root,f);
res=(res+abs(f-x))%MOD;
}
}
}
cout<<res<<endl;
return 0;
}