splay模板整理
1.插入一个数
void insert(int x)
{
if (!root)
{
++tot;
e[tot].left = e[tot].right = e[tot].fa = ;
e[tot].v = x;
e[tot].cnt = sizee[tot] = ;
root = tot;
return;
}
int now = root,fa = ;
while ()
{
if(e[now].v == x)
{
e[now].cnt++;
update(now);
update(fa);
splay(now);
break;
}
fa = now;
if (e[now].v < x)
now = e[now].right;
else
now = e[now].left;
if (!now)
{
++tot;
e[tot].left = e[tot].right = ;
e[tot].fa = fa;
e[tot].v = x;
e[tot].cnt = sizee[tot] = ;
if (e[fa].v < x)
e[fa].right = tot;
else
e[fa].left = tot;
update(fa);
splay(tot);
break;
}
}
}
2.splay
void splay(int x,int yy)
{
if (yy == )
root = x;
while (e[x].fa != yy)
{
pushdown(x);
int y = e[x].fa;
int z = e[y].fa;
if (z == yy || z == )
{
if (x == e[y].left)
turnr(x);
else
turnl(x);
}
else
{
if (e[z].left == y && e[y].left == x)
{
turnr(y);
turnr(x);
}
else
{
if (e[z].right == y && e[y].right == x)
{
turnl(y);
turnl(x);
}
else
{
if (e[z].left == y && e[y].right == x)
{
turnl(x);
turnr(x);
}
else
{
turnr(x);
turnl(x);
}
}
}
}
}
if (yy == )
root = x;
}
3.左右旋
void turnr(int x)
{
pushdown(x);
int y = e[x].fa;
int z = e[y].fa;
e[y].left = e[x].right;
if (e[x].right != )
e[e[x].right].fa = y;
e[x].fa = z;
if (z != )
{
if (e[z].left == y)
e[z].left = x;
else
e[z].right = x;
}
e[x].right = y;
e[y].fa = x;
update(x);
update(y);
} void turnl(int x)
{
pushdown(x);
int y = e[x].fa;
int z = e[y].fa;
e[y].right = e[x].left;
if (e[x].left != )
e[e[x].left].fa = y;
e[x].fa = z;
if (z != )
{
if (e[z].left == y)
e[z].left = x;
else
e[z].right = x;
}
e[x].left = y;
e[y].fa = x;
update(x);
update(y);
}
4.找前驱/后继(若点已经在splay里面)
int findl(int x)
{
int y = e[x].left;
if (y == -)
return y;
while (e[y].right != -)
y = e[y].right;
return y;
} int findr(int x)
{
int y = e[x].right;
if (y == -)
return y;
while (e[y].left != -)
y = e[y].left;
return y;
}
若点不在splay里面
void findl(int x)
{
int now = root;
temp1 = -;
v1 = 0x7fffffff;
while (now != -)
{
if (e[now].v < x && (x - e[now].v) < v1)
{
temp1 = now;
v1 = x - e[now].v;
}
if (e[now].v < x)
now = e[now].right;
else
now = e[now].left;
}
} void findr(int x)
{
int now = root;
temp2 = -;
v2 = 0x7fffffff;
while (now != -)
{
if (e[now].v > x && (e[now].v - x) < v2)
{
temp2 = now;
v2 = e[now].v - x;
}
if (e[now].v < x)
now = e[now].right;
else
now = e[now].left;
}
}
5.删除
void del(int x)
{
int p = find(x);
splay(p);
if (e[p].cnt > )
{
e[p].cnt--;
update(p);
return;
}
if (e[p].left == - && e[p].right == -)
{
root = -;
return;
}
if (e[p].left == -)
{
root = e[p].right;
e[e[p].right].fa = -;
return;
}
if (e[p].right == -)
{
root = e[p].left;
e[e[p].left].fa = -;
return;
}
int j = e[p].left;
while (e[j].right != -)
j = e[j].right;
splay(j);
e[j].right = e[p].right;
e[e[p].right].fa = j;
update(j);
}
6.查询数x的排名
int query(int x)
{
int p = root,res = ;
while (p != -)
{
if (x < e[p].v)
p = e[p].left;
else
{
res += getsize(e[p].left);
if (x == e[p].v)
return res + ;
res += e[p].cnt;
p = e[p].right;
}
}
return res;
}
7.查询排名为x的数
int query2(int x)
{
int p = root;
while (p != -)
{
if (e[p].left && x <= sizee[e[p].left])
p = e[p].left;
else
{
int temp = getsize(e[p].left) + e[p].cnt;
if (x <= temp)
return e[p].v;
x -= temp;
p = e[p].right;
}
}
return p;
}
8.各种区间操作(bzoj1500代码):
#include <stack>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm> using namespace std; const int maxn = ,inf = ;
stack <int> s;
int n,m,a[maxn],root,tot,sizee[maxn]; struct node
{
int fa,left,right,v,sum,ans,lmax,rmax,tag,cnt;
}e[maxn]; void pushup(int x)
{
sizee[x] = + sizee[e[x].left] + sizee[e[x].right];
e[x].sum = e[e[x].left].sum + e[e[x].right].sum + e[x].v;
e[x].lmax = max(e[e[x].left].lmax,e[e[x].left].sum + e[x].v + max(,e[e[x].right].lmax));
e[x].rmax = max(e[e[x].right].rmax,e[e[x].right].sum + e[x].v + max(,e[e[x].left].rmax));
e[x].ans = max(e[e[x].left].ans,e[e[x].right].ans);
e[x].ans = max(e[x].ans,max(e[e[x].left].rmax,) + e[x].v + max(,e[e[x].right].lmax));
} void fan(int x)
{
int t = e[x].lmax;
e[x].lmax = e[x].rmax;
e[x].rmax = t;
t = e[x].left;
e[x].left = e[x].right;
e[x].right = t;
e[x].tag ^= ;
} void cover(int x,int y)
{
e[x].sum = sizee[x] * y;
e[x].v = y;
e[x].maxx = y;
if (y <= )
e[x].lmax = e[x].rmax = e[x].ans = y;
else
e[x].lmax = e[x].rmax = e[x].ans = y * sizee[x];
e[x].cnt = ;
} void pushdown(int x)
{
if (e[x].tag)
{
if (e[x].left)
fan(e[x].left);
if (e[x].right)
fan(e[x].right);
e[x].tag = ;
}
if (e[x].cnt)
{
if (e[x].left)
cover(e[x].left,e[x].v);
if (e[x].right)
cover(e[x].right,e[x].v);
e[x].cnt = ;
}
} void build(int l,int r,int &x,int y)
{
if (l > r)
return;
if (!x)
{
if (!s.empty())
{
x = s.top();
s.pop();
}
else
x = ++tot;
}
int mid = (l + r) >> ;
e[x].v = a[mid];
e[x].fa = y;
build(l,mid - ,e[x].left,x);
build(mid + ,r,e[x].right,x);
pushup(x);
} void turnr(int x)
{
pushdown(x);
int y = e[x].fa;
int z = e[y].fa;
e[y].left = e[x].right;
if (e[x].right != )
e[e[x].right].fa = y;
e[x].fa = z;
if (z != )
{
if (e[z].left == y)
e[z].left = x;
else
e[z].right = x;
}
e[x].right = y;
e[y].fa = x;
pushup(x);
pushup(y);
} void turnl(int x)
{
pushdown(x);
int y = e[x].fa;
int z = e[y].fa;
e[y].right = e[x].left;
if (e[x].left != )
e[e[x].left].fa = y;
e[x].fa = z;
if (z != )
{
if (e[z].left == y)
e[z].left = x;
else
e[z].right = x;
}
e[x].left = y;
e[y].fa = x;
pushup(x);
pushup(y);
} void splay(int x,int yy)
{
while (e[x].fa != yy)
{
pushdown(x);
int y = e[x].fa;
int z = e[y].fa;
if (z == || z == yy)
{
if (e[y].left == x)
turnr(x);
else
turnl(x);
}
else
{
if (e[z].left == y && e[y].left == x)
{
turnr(y);
turnr(x);
}
else
{
if (e[z].right == y && e[y].right == x)
{
turnl(y);
turnl(x);
}
else
{
if (e[z].left == y && e[y].right == x)
{
turnl(x);
turnr(x);
}
else
{
turnr(x);
turnl(x);
}
}
}
}
}
if (yy == )
root = x;
pushup(x);
} int find(int x,int k)
{
pushdown(x);
if (k > sizee[e[x].left] + )
return find(e[x].right,k - - sizee[e[x].left]);
if (k == sizee[e[x].left] + )
return x;
return find(e[x].left,k);
} void del(int x)
{
if (!x)
return;
s.push(x);
del(e[x].left);
del(e[x].right);
sizee[x] = e[x].left = e[x].right = e[x].cnt = e[x].tag = e[x].fa = e[x].sum = e[x].v = ;
e[x].maxx = e[x].lmax = e[x].rmax = e[x].ans = -inf;
} int main()
{
for (int i = ; i < maxn; i++)
e[i].lmax = e[i].rmax = e[i].ans = -inf;
scanf("%d%d",&n,&m);
for (int i = ; i <= n; i++)
scanf("%d",&a[i]);
build(,n + ,root,);
root = ;
for (int i = ; i <= m; i++)
{
char s[];
scanf("%s",s);
if (s[] == 'I')
{
int x,y;
scanf("%d%d",&x,&y);
for (int j = ; j <= y; j++)
scanf("%d",&a[j]);
int p = find(root,x + ),q = find(root,x + );
splay(p,);
splay(q,p);
build(,y,e[q].left,q);
pushup(q);
pushup(p);
}
if (s[] == 'D')
{
int x,y;
scanf("%d%d",&x,&y);
int p = find(root,x),q = find(root,x + y + );
splay(p,);
splay(q,p);
del(e[q].left);
e[q].left = ;
pushup(q);
pushup(p);
}
if (s[] == 'M' && s[] == 'K')
{
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
int p = find(root,x),q = find(root,x + y + );
splay(p,);
splay(q,p);
cover(e[q].left,z);
pushup(q);
pushup(p);
}
if (s[] == 'R')
{
int x,y;
scanf("%d%d",&x,&y);
int p = find(root,x),q = find(root,x + y + );
splay(p,);
splay(q,p);
if (e[q].left && !e[e[q].left].tag)
fan(e[q].left);
pushup(q);
pushup(p);
}
if (s[] == 'G')
{
int x,y;
scanf("%d%d",&x,&y);
int p = find(root,x),q = find(root,x + y + );
splay(p,);
splay(q,p);
printf("%d\n",e[e[q].left].sum);
}
if (s[] == 'M' && s[] == 'X')
{
int p = find(root,),q = find(root,sizee[root]);
splay(p,);
splay(q,p);
printf("%d\n",e[e[q].left].ans);
}
} return ;
}
splay模板整理的更多相关文章
- [luogu3369/bzoj3224]普通平衡树(splay模板、平衡树初探)
解题关键:splay模板题整理. 如何不加入极大极小值?(待思考) #include<cstdio> #include<cstring> #include<algorit ...
- ACM算法模板整理
史诗级ACM模板整理 基本语法 字符串函数 istream& getline (char* s, streamsize n ); istream& getline (char* s, ...
- bzoj 1588 splay模板题
用晚自习学了一下splay模板,没想象中那么难,主要是左旋和右旋可以简化到一个函数里边,减少代码长度... #include<iostream> #include<cstdio> ...
- COJ 1002 WZJ的数据结构（二）（splay模板）
我的LCC,LCT,Splay格式终于统一起来了... 另外..这个形式的Splay是标准的Splay(怎么鉴别呢?看Splay函数是否只传了一个变量node就行),刘汝佳小白书的Splay写的真是不 ...
- Splay 模板
Splay 模板 struct SplayTree{ const static int maxn = 1e5 + 15; int ch[maxn][2] , key[maxn] , s[maxn] , ...
- BZOJ1588 [HNOI2002]营业额统计 splay模板
1588: [HNOI2002]营业额统计 Time Limit: 5 Sec Memory Limit: 162 MB Submit: 16189 Solved: 6482 [Submit][S ...
- 文艺平衡树（splay模板）
题干:splay模板,要求维护区间反转. splay是一种码量小于treap,但支持排名,前驱后继等treap可求的东西,也支持区间反转的平衡树. 但是有两个坏处: 1.splay常数远远大于trea ...
- 字符串系列——KMP模板整理
KMP模板整理 KMP与扩展KMP: /*vs 2017/ vs code以外编译器,去掉windows.h头文件和system("pause");*/ #include<i ...
- [洛谷P3391] 文艺平衡树 (Splay模板)
初识splay 学splay有一段时间了,一直没写...... 本题是splay模板题,维护一个1~n的序列,支持区间翻转(比如1 2 3 4 5 6变成1 2 3 6 5 4),最后输出结果序列. ...
随机推荐
- js中随机数获取
// 结果为0-1间的一个随机数(包括0,不包括1) var randomNum1 = Math.random(); //console.log(randomNum1); // 函数结果为入参的整数部 ...
- 有关a++，++a的基础问题
今天跟朋友讨论java的赋值与自增问题 @Test public void test2() { int a = 5; int b = a++; System.out.println("a = ...
- Rhadoop安装
1.ubuntu,hadoop,R,jdk安装好 2.下载Rhadoop项目的的三个包,rmr,hdfs,rHBase存放到Downloads/R. 3.切换到root 4.安装依赖的库 ~R CMD ...
- python之enumerate
http://eagletff.blog.163.com/blog/static/116350928201266111125832/一般情况下,如果要对一个列表或者数组既要遍历索引又要遍历元素时,可以 ...
- AngularJS 字符串
AngularJS字符串就像是JavaScript字符串 <!DOCTYPE html><html><head><meta http-equiv=" ...
- 导航条(Navbar)
1.添加.navbar-fixed-top类可以让导航条固定的页面的顶部,固定的导航条会遮住页面上其它的内容,除非给body元素设置padding,导航条默认高度为50px ,因此可以给body元素设 ...
- mbstring未安装
yum install php55w-mbstring.x86_64 把php版本换成自己的就ok
- 前端－带header和footer的双栏布局
目标是实现如上图带header和footer的双栏布局,其中右侧sidebar是固定宽度,左侧content是自适应: https://www.zybuluo.com/dengzhirong/note ...
- [牛客OI测试赛2]F假的数学游戏(斯特灵公式)
题意 输入一个整数X,求一个整数N,使得N!恰好大于$X^X$. Sol 考试的时候只会$O(n)$求$N!$的前缀和啊. 不过最后的结论挺好玩的 $n! \approx \sqrt{2 \pi n} ...
- 04vim的使用
linux常用命令 workon 查看已经安装的虚拟环境 deactivate 退出虚拟环境 whoami 查看用户 sudo bash install.sh 添加权限 pwd 查看在那个路径下 cd ...