bzoj1014火星人

...强迫症终于A了这道题  bzoj前30道全A指日可待

splay维护这个结点控制的字符串的hash值

每次旋转重新算一遍就可以了

查询的时候跑一个二分

讲起来很简单但是还是调了1h才调对了splay

把main写完饺子都凉了

没写过几次平衡树 常数写的奇大 能递归的我都递归了。。。

字符串哈希因为过于Naive只会用自然溢出。。。

但是1A了

家里的电脑有写好的read和write

我竟然忘了。。。

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<stack>
#define ll unsigned long long
#define pi 3.14
#define eps 1e-9
#define inf 2147483233
#define m(a) memset(a,0,sizeof(a))
#define M(a) memset(a,127,sizeof(a))
#define REP(i,m,n) for(int i=1;i<=n;i++)
#define DWN(i,n,m) for(int i=n;i>=1;i++)
#define lowbit(x) x&(-x)
using namespace std;
int n;
inline int read()
{
    int x=,f=;
    char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-;ch=getchar();}
    while(isdigit(ch)){x=*x+ch-'';ch=getchar();}
    return x*f;
}
inline void write(int x)
{
    int num=;
    char buf[];
    while(x)buf[++num]=(x%)+'',x/=;
    while(num)putchar(buf[num--]);
    putchar('\n');
}
ll powe[];
void makepow()
{
    int i;
    for(powe[]=,i=;i<;i++)powe[i]=powe[i-]*;
}
const int maxn=;
char str[maxn];
struct SplayTree
{
    int rt,Size;
    int son[maxn][],f[maxn],size[maxn];
    ll val[maxn],hsh[maxn];
    char s[maxn];
    inline void pushup(int x){size[x]=size[son[x][]]+size[son[x][]]+;hsh[x]=hsh[son[x][]]+powe[size[son[x][]]]*s[x]+powe[size[son[x][]]+]*hsh[son[x][]];}
    inline void Rotate(int x,int type)
    {
        int y=f[x];
        son[y][!type]=son[x][type];
        f[son[x][type]]=y;
        f[x]=f[y];
        if(f[x])son[f[y]][son[f[y]][]==y]=x;
        son[x][type]=y;
        f[y]=x;
        size[x]=size[y],hsh[x]=hsh[y];
        pushup(y);
    }
    inline void splay(int x,int goal)
    {
        while(f[x]!=goal)
        {
            if(f[f[x]]==goal)
            {
                if(son[f[x]][]==x)Rotate(x,);
                else Rotate(x,);
            }
            else
            {
               int y=f[x],z=f[y];
               if(son[z][]==y)
               {
                  if(son[y][]==x)Rotate(y,),Rotate(x,);
                  else Rotate(x,),Rotate(x,);
               }
               else
               {
                   if(son[y][]==x)Rotate(y,),Rotate(x,);
                   else Rotate(x,),Rotate(x,);
               }
            }
        }
        if(goal==) rt=x;
    }
    inline int rank(int x,int k)
    {
        if(k<=size[son[x][]]) return rank(son[x][],k);
        else if(k==size[son[x][]]+) return x;
        else return rank(son[x][],k-size[son[x][]]-);
    }
    inline int build(int l,int r,int id)
    {
        if(l>r)return ;
        int x=++Size,mid=(l+r)>>;
        f[x]=id;
        s[x]=str[mid];
        son[x][]=build(l,mid-,x);
        son[x][]=build(mid+,r,x);
        pushup(x);
        return x;
    }
    inline void insert(int k,char val)
    {
        int x=rank(rt,k),y=rank(rt,k+);
        splay(x,),splay(y,x);
        s[++Size]=val;
        f[Size]=y,son[y][]=Size;
        pushup(Size);
        pushup(y);
        pushup(x);
    }
    inline void change(int k,int val)
    {
        int x=rank(rt,k);
        splay(x,);
        s[x]=val;
        pushup(x);
    }
    inline int bisearch(int kx,int ky)
    {
        int l=,r=n,mid;
        while(l<=r)
        {
            mid=l+r>>;
            if(ky+mid>n+)
            {
                r=mid-;
                continue;
            }
            int x=rank(rt,kx-),y=rank(rt,kx+mid);
            splay(x,),splay(y,x);
            ll temp=hsh[son[y][]];
            x=rank(rt,ky-),y=rank(rt,ky+mid);
            splay(x,),splay(y,x);
            if(temp==hsh[son[y][]])l=mid+;
            else r=mid-;
        }
        return r;
    }
}splay;
int main()
{
    int m,i,j,k,x,y;
    char op[],val[];
    scanf("%s%d",str+,&m);
    makepow();
    n=strlen(str+);
    splay.rt=splay.build(,n+,);
    for(i=;i<=m;i++)
    {
        scanf("%s",op);
        if(op[]=='I')
        {
            scanf("%d%s",&x,val);
            splay.insert(x+,val[]);
            n++;
        }
        else if(op[]=='R')
        {
            scanf("%d%s",&x,val);
            splay.change(x+,val[]);
        }
        else
        {
            scanf("%d%d",&x,&y);
            if(x>y)  swap(x,y);
            if(x!=y)
                printf("%d\n",splay.bisearch(x+,y+));
            else
                printf("%d\n",n-x+);
        }
    }
    return ;
}