bzoj1269

题解：

splay维护

只不过变成了字符串

代码：

#include<bits/stdc++.h>
using namespace std;
const int L=+,BS= + ,BN= + ;
int Cur=,head,tot;
char str[L];
struct Block
{
    int size,nxt;
    bool rev;
    char a[BS];
    void Clear(){size=;nxt=-,rev=;}
}B[BN];
queue<int>q;
int NewNode()
{
    int t=q.front();q.pop();
    B[t].Clear();
    return t;
}
void Pre()
{
    while (q.size()!=)q.pop();
    for (int i=;i<BN;i++)q.push(i);
    head=NewNode();
}
void Find(int &idx,int &cur)
{
    while(idx!=-&&cur>B[idx].size)cur-=B[idx].size,idx=B[idx].nxt;
}
void Pushdown(int idx)
{
    if (B[idx].rev)
     {
        reverse(B[idx].a,B[idx].a+B[idx].size);
        B[idx].rev=;
     }

}
void Split(int idx,int cur)
{
    if(idx==-||cur==B[idx].size)return;
    Pushdown(idx);
    int tot=NewNode();
    memcpy(B[tot].a,B[idx].a+cur,sizeof(char)*(B[idx].size-cur) );
    B[tot].size=B[idx].size-cur;
    B[idx].size=cur;
    B[tot].nxt=B[idx].nxt;
    B[idx].nxt=tot;
}
void Delet(int idx){q.push(idx);}
void Merge(int idx)
{
    for (int i=idx;i!=-;i=B[i].nxt)
     for (int j=B[i].nxt;j!=-;j=B[j].nxt)
      {
        if (B[i].size+B[j].size<=BS)
         {
            Pushdown(i);
            Pushdown(j);
            memcpy(B[i].a+B[i].size,B[j].a,sizeof(char) * B[j].size);
            B[i].size+=B[j].size;B[i].nxt=B[j].nxt;
            Delet(j);
         }
        else break;
      }
}
void Insert(int cur,int x,char *str)
{
    int idx=head;
    Find(idx,cur);
    Split(idx,cur);
    int i=;
    while(i<x)
     {
        int Limit=min(BS,x-i);
        int tot=NewNode();
        memcpy(B[tot].a,str+i,sizeof(char) * Limit);
        B[tot].size=Limit;
        B[tot].nxt=B[idx].nxt;
        B[idx].nxt=tot;
        idx=B[idx].nxt;
        i+=Limit;
     }
    Merge(head);
}
void Print(int cur)
{
    int idx=head;
    Find(idx,cur);
    if(cur==B[idx].size) idx=B[idx].nxt,cur=;
    Pushdown(idx);
    printf("%c\n",B[idx].a[cur]);
}
void Rever(int l,int r)
{
    int idx=head;
    Find(idx,l);
    Split(idx,l);
    int Start=idx,StartNxt=B[idx].nxt;
    idx=head;
    Find(idx,r);
    Split(idx,r);
    int EndNxt=B[idx].nxt,Tmp[BN],cnt=;
    for (int i=StartNxt;i!=EndNxt;i=B[i].nxt)B[i].rev^=,Tmp[++cnt]=i;
    Tmp[++cnt]=Start;Tmp[]=EndNxt;
    for (int i=cnt;i>=;i--)B[Tmp[i]].nxt=Tmp[i-];
    Merge(head);
}
void Dele(int l,int r)
{
    int idx=head;
    Find(idx,l);
    Split(idx,l);
    int Start=idx,StartNxt=B[idx].nxt;
    idx=head;
    Find(idx,r);
    Split(idx,r);
    int EndNxt=B[idx].nxt;
    for (int i=StartNxt;i!=EndNxt;i=B[i].nxt)Delet(i);
    B[Start].nxt=EndNxt;
    Merge(head);
}
int main()
{
    int N;
    scanf("%d",&N);
    char opt[];
    Pre();
    while(N--)
     {
        scanf("%s",opt);
        if (opt[]=='M') scanf("%d",&Cur);
        else if (opt[]=='I')
         {
            int len;
            scanf("%d",&len);
            int i=;
            while(i<len){char ch=getchar();if (ch>=&&ch<=)str[i++]=ch;}
            str[i++]='\0';
            Insert(Cur,len,str);
         }
        else if(opt[]=='D')
         {
            int x;
            scanf("%d",&x);
            Dele(Cur,Cur+x);
         }
        else if(opt[]=='R')
         {
            int x;
            scanf("%d",&x);
            Rever(Cur,x+Cur);
         }
        else if(opt[]=='G')Print(Cur);
        else if(opt[]=='P')Cur--;
        else if(opt[]=='N')Cur++;
     }
    return ;
}