一道题昨天写了一天然后写的乱七八糟,后来发现自己思路有问题。然后找了两位大佬的题解:
https://www.cnblogs.com/zig-zag/archive/2013/03/28/2987390.html
http://blog.csdn.net/qwsin/article/details/53995984
侵删。
思路:
splay也可以看作会旋转的线段树。每个结点有 size,sum,maxsum,la,ra(以该节点为根节点的树的节点个数,和,最大连续和,最大前缀和,最大后缀和),和两个标记cov,rev(覆盖标记和反转标记)。
当对一段区间[l,r]进行区间操作时,先把r+1结点splay到根结点,再把l-1结点 splay到根节点的左儿子,则根节点左儿子的右儿子便是目标区间。
这个题需要使用内存池,不然会TLE;
数组版内存池:开一个栈q,在删除结点x的时候,把结点x放入栈q中。需要建立新结点时,如果q中有可用的结点,则用q中的结点,q为空再新建结点。
指针版内存池:开始时开一个数组Node* pool[maxn];初始化时将pool全部分配内存。新建结点时从pool里取。
inline void init(){for(int i=0;i<maxn;++i)pool[i]=new Node(0);}
inline void newnode(Node* &p,int v,Node *fa){
p=pool[top++];*p=Node(v);p->fa=fa;
}
inline void del(Node* &p){pool[--top]=p;p=NULL;}
re的代码还没找到错误··· 对拍也一直没错,莫非是递归的splay爆栈了?
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <cstdlib>
using namespace std;
const int maxn=1000000+10;
const int INF=(1<<30);
int a[maxn];
int n,m;
struct Node{
Node* ch[2];
int v,s;
int sum,Msum,ls,rs;
int re,co;//反转标记和覆盖标记
Node(int v):v(v){
s=1;
ch[0]=ch[1]=NULL;
re=0;co=INF;
ls=rs=Msum=sum=v;
}
int cmp(int k){
int d=k;
if(ch[0]!=NULL)
d=k-ch[0]->s;
if(d==1)return -1;
return d<=0?0:1;
}
void maintain(){
int ll=-INF,rl=-INF,lr=-INF,rr=-INF,lsum=0,rsum=0;//rl右边的l
int LMsum=-INF,RMsum=-INF;
s=1;sum=v;
if(ch[0]!=NULL){
s+=ch[0]->s;
lsum=ch[0]->sum;
ll=ch[0]->ls;
lr=ch[0]->rs;
LMsum=ch[0]->Msum;
}
if(ch[1]!=NULL){
s+=ch[1]->s;
rsum=ch[1]->sum;
rl=ch[1]->ls;
rr=ch[1]->rs;
RMsum=ch[1]->Msum;
}
ls=max(ll,lsum+v+max(rl,0));
rs=max(rr,rsum+v+max(lr,0));
sum+=lsum+rsum;
Msum=max(max(LMsum,RMsum),v+max(0,lr)+max(0,rl));
}
void pushdown(){//有标记既已经被修改
if(re){
if(ch[0]!=NULL){
ch[0]->re^=1;
swap(ch[0]->ch[0],ch[0]->ch[1]);
swap(ch[0]->ls,ch[0]->rs);
}
if(ch[1]!=NULL){
ch[1]->re^=1;
swap(ch[1]->ch[0],ch[1]->ch[1]);
swap(ch[1]->ls,ch[1]->rs);
}
re=0;
}
if(co!=INF){
if(ch[0]!=NULL){
ch[0]->co=co;
ch[0]->v=co;
ch[0]->sum=ch[0]->s*co;
ch[0]->ls=ch[0]->rs=ch[0]->Msum=max(co,ch[0]->sum);
}
if(ch[1]!=NULL){
ch[1]->co=co;
ch[1]->v=co;
ch[1]->sum=ch[1]->s*co;
ch[1]->ls=ch[1]->rs=ch[1]->Msum=max(co,ch[1]->sum);
}
co=INF;
}
}
}*pool[maxn],*root;
int top;
void init(){
top=0;
for(int i=0;i<=maxn;i++)pool[i]=new Node(0);
}
Node* newnode(int v){
Node* o=pool[top++];
*o=Node(v);
return o;
}
void del(Node* &o){pool[--top]=o;o=NULL;}
void deltree(Node* &o){//将o和其子树删除
if(o->ch[0]!=NULL)deltree(o->ch[0]);
if(o->ch[1]!=NULL)deltree(o->ch[1]);
del(o);
}
void rotate(Node* &o,int d){
Node* k=o->ch[d^1];o->ch[d^1]=k->ch[d];k->ch[d]=o;
o->maintain();k->maintain();o=k;
}
void splay(Node* &o,int k){//将第k大的结点转到o的位置
o->pushdown();
int d=o->cmp(k);
if(d==1)
if(o->ch[0]!=NULL)
k-=o->ch[0]->s+1;
else k=k-1;
if(d!=-1){
Node* p=o->ch[d];
p->pushdown();
int d2=p->cmp(k);
int k2;
if(d2==1){
if(p->ch[0]!=NULL)
k2=k-p->ch[0]->s-1;
else k2=k-1;
}else k2=k;
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);
}
}
void split(Node* o,Node* &left,Node* &right,int k){
splay(o,k);
o->pushdown();
right=o->ch[1];
left=o;
left->ch[1]=NULL;
left->maintain();
}
Node* merge(Node* left,Node* right){
if(left->ch[1]!=NULL)
splay(left,left->s);
left->pushdown();
left->ch[1]=right;
left->maintain();
return left;
}
Node* build(int l,int r){
if(l>r)return NULL;
int mid=l+(r-l)/2;
//Node* o=new Node(a[mid]);
Node*o=newnode(a[mid]);
o->ch[0]=build(l,mid-1);
o->ch[1]=build(mid+1,r);
o->maintain();
}
void tra(Node* o){
o->pushdown();
if(o->ch[0]!=NULL)tra(o->ch[0]);
cout<<o->v<<" "<<o->s<<" "<<o->sum<<" "<<o->Msum<<endl;
if(o->ch[1]!=NULL)tra(o->ch[1]);
}
void insert(Node* &o){
int pos,tot;
scanf("%d%d",&pos,&tot);
for(int i=1;i<=tot;i++)
scanf("%d",&a[i]);
Node* mid=build(1,tot);
Node* left,*right;
split(o,left,right,pos+1);
o=merge(merge(left,mid),right);
}
void remove(Node* &o){
int pos,tot;
scanf("%d%d",&pos,&tot);
Node* left,*mid,*right;
split(o,left,mid,pos);
split(mid,mid,right,tot);
// delete mid;
deltree(mid);
o=merge(left,right);
}
void recover(Node* &o){
int pos,tot,c;
scanf("%d%d%d",&pos,&tot,&c);
Node* left,*mid,*right;
split(o,left,mid,pos);
split(mid,mid,right,tot);
mid->co=c;mid->v=c;
mid->ls=mid->rs=mid->sum=c*mid->s;
mid->Msum=max(mid->sum,c);
//mid->pushdown();
o=merge(merge(left,mid),right);
}
void reverse(Node* &o){
int pos,tot;
scanf("%d%d",&pos,&tot);
Node* left,*mid,*right;
split(o,left,mid,pos);
split(mid,mid,right,tot);
mid->re^=1;
swap(mid->ch[0],mid->ch[1]);
swap(mid->ls,mid->rs);
o=merge(merge(left,mid),right);
}
int sum(Node* &o){
int pos,tot,ans;
scanf("%d%d",&pos,&tot);
Node* left,*mid,*right;
split(o,left,mid,pos);
split(mid,mid,right,tot);
ans= mid->sum;
o=merge(merge(left,mid),right);
return ans;
}
int MAXSUM(Node* &o){
Node* left,*right;
split(o,left,right,1);
int ans=right->Msum;
o=merge(left,right);
return ans;
}
int main(){
init();
scanf("%d%d",&n,&m);
for(int i=2;i<=n+1;i++)scanf("%d",&a[i]);
a[1]=0;
root=build(1,n+1);
string name;
for(int i=1;i<=m;i++){
cin>>name;
if(name=="INSERT"){
insert(root);
}
if(name=="DELETE"){
remove(root);
}
if(name=="MAKE-SAME"){
recover(root);
}
if(name=="REVERSE"){
reverse(root);
}
if(name=="GET-SUM"){
cout<<sum(root)<<endl;
}
if(name=="MAX-SUM"){
cout<<MAXSUM(root)<<endl;
}
}
return 0;
}