POJ 3580 SuperMemo splay 翻轉 右移

很多解釋都在代碼裡…

聽說這種題叫填空題….ORZ

開始在insert(x+1,y+1)然後逾時了…..

WA的話注意一下每次是否進行Push_up

每次改變區間的值都要及時的向上Push_up，否則直接詢問得不到需要的MIN

對了…. 逾時的話還有可能是翻轉那裡，那個t可能為負數，是以一定不能直接MOD

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<queue>
#include<stack>
#include<string>
#include<vector>
#include<map>
#include<set>
using namespace std;
#define rfor(i,a,b) for(i=a;i<=b;++i)
#define lfor(i,a,b) for(i=a;i>=b;--i)
#define sfor(i,a,h) for(i=h[a];i!=-1;i=e[i].next)
#define mem(a,b) memset(a,b,sizeof(a))
#define mec(a,b) memcpy(a,b,sizeof(b))
#define cheak(i) printf("%d ",i)
#define min(a,b) (a>b?b:a)
#define max(a,b) (a>b?a:b)
#define inf 0x3f3f3f3f
#define lowbit(x) (x&(-x))
typedef long long LL;
#define maxn 200005
#define maxm maxn*maxn
#define lson(x) (splay[x].son[0])
#define rson(x) (splay[x].son[1])
struct SSplay
{
    int val,size,fa,son[],flag,Min,add;
    void init()
    {
        add=size=fa=son[]=son[]=flag=;
        val=Min=inf;
    }
}splay[maxn];
int tots,root;
int A[maxn];
void print(int x);
void build(int &x,int l,int r,int fa);
void NewNode(int &x,int fa,int k)
{
    x=++tots;
    splay[x].val=k;
    splay[x].fa=fa;
    splay[x].size=;
    splay[x].son[]=splay[x].son[]=;
    splay[x].flag=;
    splay[x].add=;
    splay[x].Min=k;
}
void Push_up(int x);
void init(int n)
{
    tots=root=;
    splay[].init();
    NewNode(root,,-);
    NewNode(rson(root),root,-);
    build(lson(rson(root)),,n,rson(root));
    Push_up(rson(root));
    Push_up(root);
}
void Push_up(int x)
{
    splay[x].size=splay[lson(x)].size+splay[rson(x)].size+;
    splay[x].Min=splay[x].val;
    if(lson(x)) splay[x].Min=min(splay[x].Min,splay[lson(x)].Min);
    if(rson(x)) splay[x].Min=min(splay[x].Min,splay[rson(x)].Min);
}
void Update_Rev(int x)
{
    if(!x) return ;
    swap(lson(x),rson(x));
    splay[x].flag^=;
}
void Update_Add(int x,int val)
{
    if(!x) return ;
    splay[x].val+=val;
    splay[x].Min+=val;
    splay[x].add+=val;
}
void Push_down(int x)
{
    if(splay[x].flag)
    {
        splay[x].flag=;
        Update_Rev(lson(x));
        Update_Rev(rson(x));
    }
    if(splay[x].add)
    {
        Update_Add(lson(x),splay[x].add);
        Update_Add(rson(x),splay[x].add);
        splay[x].add=;
    }
}
void Rotate(int x,int kind)
{
    int pre=splay[x].fa;
    Push_down(pre);Push_down(x);
    splay[pre].son[!kind]=splay[x].son[kind];
    splay[splay[x].son[kind]].fa=pre;
    if(splay[pre].fa)
    splay[splay[pre].fa].son[splay[splay[pre].fa].son[]==pre]=x;
    splay[x].fa=splay[pre].fa;
    splay[x].son[kind]=pre;
    splay[pre].fa=x;
    Push_up(pre);Push_up(x);
}
void Splay(int x,int goal)
{
    Push_down(x);
    while(splay[x].fa!=goal)
    {
        int pre=splay[x].fa;
        if(splay[pre].fa==goal)
        {
            Push_down(pre);Push_down(x);
            Rotate(x,splay[pre].son[]==x);
        }
        else
        {
            Push_down(splay[pre].fa);
            Push_down(pre);
            Push_down(x);
            int kind=splay[splay[pre].fa].son[]==pre;
            if(splay[pre].son[kind]==x)
            Rotate(x,!kind),Rotate(x,kind);
            else Rotate(pre,kind),Rotate(x,kind);
        }
    }
    Push_up(x);
    if(!goal) root=x;
}
int find(int k,int x=root)
{
    Push_down(x);
    if(splay[lson(x)].size==k-)
    return x;
    if(k>splay[lson(x)].size)
    {
        k-=splay[lson(x)].size+;
        return find(k,rson(x));
    }
    else
    return find(k,lson(x));
}
//ADD x y z:x~y的元素都+z 
void Add(int l,int r,int val)
{
    Splay(find(l-),);Splay(find(r+),root);
    Update_Add(lson(rson(root)),val);
    Push_up(rson(root));
    Push_up(root);
}
//REVERSE x y:旋轉x~y √(加一個flag 
void Reverse(int l,int r)
{
    Splay(find(l-),);Splay(find(r+),root);
    Update_Rev(lson(rson(root)));
    Push_up(rson(root));
    Push_up(root);
}
//REVOLVE x y z:x~y向右移z個位置(區間内右移 (注意mod 
// 從(y-z+1)~y的元素移到x-1後當然z%=(y-x+1)
//  可以先splay(y-z,0),splay(y+1,root)得到(y-z+1)~y區間,記錄lson(rson(root)),删除兒子邊 
//   splay(x,root),splay(x-1,lson(root))
//    然後把lson(rson(root))的子樹移到lson(lson(root))的右子樹上 
void Revolve(int l,int r,int t)
{
    int len=r-l+;
    t=(t%len+len)%len;
    if(!t) return ;
    int mid=(r-t+);
    Splay(find(mid-),);
    Splay(find(r+),root);
    int tmp=lson(rson(root));
    lson(rson(root))=;
    Push_up(rson(root));
    Push_up(root);
    Splay(find(l-),);
    Splay(find(l),root);
    lson(rson(root))=tmp;
    splay[tmp].fa=rson(root);
    Push_up(rson(root));
    Push_up(root);
}
//INSERT x y:向第x個元素後面插入y √( 把x+1的位置移到root 然後rson(x)=y
void Insert(int x,int val)
{
    Splay(find(x),);Splay(find(x+),root);
    NewNode(lson(rson(root)),rson(root),val);
    Push_up(lson(rson(root)));
    Push_up(rson(root));Push_up(root);
}
//DELETE x:删除第x個節點 √
void Delete(int x)
{
    Splay(find(x-),);Splay(find(x+),root);
    lson(rson(root))=;
    Push_up(rson(root));
    Push_up(root);
}
//MIN x y:輸出x~y之間最小的元素（多一個元素來儲存最小元素的資訊 Push_up上去 理論可行 
void print_min(int l,int r)
{
    Splay(find(l-),);Splay(find(r+),root);
    printf("%d\n",splay[lson(rson(root))].Min);
}
//建立節點時建立一個末尾節點用于INSERT
void build(int &x,int l,int r,int fa)
{
    if(l>r) return ;
    int mid=(l+r)/;
    NewNode(x,fa,A[mid]);
    if(l<mid) build(lson(x),l,mid-,x);
    if(r>mid) build(rson(x),mid+,r,x);
    Push_up(x);
}
void print(int x)
{
    printf("%d:val:%d size:%d lson:%d rson:%d Min:%d\n",x,splay[x].val,splay[x].size,lson(x),rson(x),splay[x].Min);
    if(lson(x)) print(lson(x));
    if(rson(x)) print(rson(x));
}
int main()
{
    int i,n,m,x,y,z;
    char str[];
    while(~scanf("%d",&n))
    {
        rfor(i,,n) scanf("%d",&A[i]);
        init(n);
        //print(root);
        scanf("%d",&m);
        rfor(i,,m)
        {
            scanf("%s",str);
            if(!strcmp(str,"ADD"))
            {
                scanf("%d%d%d",&x,&y,&z);
                Add(x+,y+,z);
            }
            else if(!strcmp(str,"REVERSE"))
            {
                scanf("%d%d",&x,&y);
                Reverse(x+,y+);
            }
            else if(!strcmp(str,"REVOLVE"))
            {
                scanf("%d%d%d",&x,&y,&z);
                Revolve(x+,y+,z);
            }
            else if(!strcmp(str,"INSERT"))
            {
                scanf("%d%d",&x,&y);
                Insert(x+,y);
            }
            else if(!strcmp(str,"DELETE"))
            {
                scanf("%d",&x);
                Delete(x+);
            }
            else
            {
                scanf("%d%d",&x,&y);
                print_min(x+,y+);
            }
            //print(root);
        }
    }
    return ;
}