Subpalindromes(nlogn线段树判断回文串，未填坑)

题目链接
未完成代码

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 101000;
int w[N];
int idx[N];
struct node{
    int ldata,l,r,rdata,len;
    node(){len = -1;}
}tree[4*N];
void build(int o,int l,int r){
    tree[o].len = r-l+1;
    tree[o].l = l;
    tree[o].r = r;
    if(l==r) {idx[l]=o;return;}
    int mid = l+r>>1;
    build(o<<1,1,mid);
    build(o<<1|1,mid+1,r);
}
void up(int o){
    int l = o<<1;
    int r = l|1;
    tree[o].ldata = tree[l].ldata*w[tree[r].len+1]+tree[r].ldata;  //当初始时存在问题
    tree[o].rdata = tree[r].rdata*w[tree[l].len+1]+tree[l].rdata;
}
node query(int o,int l,int r,int h,int t){
    if(l>=h&&r<=t) return tree[o];
    int mid = l+r>>1;
    node ans1,ans2;
    if(mid>=h) ans1 = query(o<<1,l,mid,h,t);
    if(mid<t) ans2 = query(o<<1|1,mid+1,r,h,t);
    if(ans1.len==-1){
        return ans2;
    }
    else {
        if(ans2.len==-1) return ans1;
        else {
            node ans;
            ans.len = ans1.len+ans2.len;
            ans.ldata = ans1.ldata*w[ans2.len+1]+ans2.ldata;
            ans.rdata = ans2.rdata*w[ans1.len+1]+ans1.rdata;
            return ans;
        }
    }
}
void add(int x,int data){
    tree[x].ldata = data;
    tree[x].rdata = data;
    while(x!=0){
        x/=2;
        up(x);
    }
}
int main()
{
    freopen("a.txt","r",stdin);
    string s;
    cin>>s;
    int i;
    build(1,1,s.length());
    for(i = 1;i <= s.length();i ++)
        add(idx[i],s[i-1]-'a'+1);
    w[1] = 1;
    for(i = 2;i <= s.length();i ++) w[i] = w[i-1]*27;
    int n;
    cin>>n;
    for(i = 1;i <= n;i ++){
        string oper;
        cin>>oper;
        if(oper[0]=='c'){
            int x;
            char c;
            cin>>x>>c;
            add(idx[x],c-'a'+1);
        }
        else {
            int l,r;
            cin>>l>>r;
            node ans = query(1,1,s.length(),l,r);
            if(ans.ldata==ans.rdata) {
                cout<<"Yes"<<endl;
            }
            else cout<<"No"<<endl;
        }
    }
    return 0;
}