Leetcode 2213 由单个字符重复的最长子字符串（线段树）

根据题目要求设计线段树节点内的信息

只需要pushup,不需要pushdown所以不需要使用懒标记，其中qurry函数也是多余的，但是此份代码主要是为了记录一个线段树的模板

class Solution {
    static const int N = 1e5 ;
    string s;
    struct TreeNode {
        int l, r, size;
        char lc, rc;
        int lmax, rmax, dmax;
    } tr[4*N];

    void pushup(TreeNode &f, TreeNode &l, TreeNode &r)
    {
        f.lmax = l.lmax, f.rmax = r.rmax, f.dmax = max(l.dmax, r.dmax);
        f.lc = l.lc, f.rc = r.rc;
        f.size = l.size + r.size;
        if (l.rc == r.lc)
        {
            if (l.lmax == l.size) f.lmax += r.lmax;
            if (r.rmax == r.size) f.rmax += l.rmax;
            f.dmax = max(f.dmax, l.rmax + r.lmax);
        }
    }

    void build(int u, int l, int r)
    {
        if (l == r)
        {
            tr[u] = { l, l, 1, s[l - 1], s[l - 1], 1, 1, 1 };
            return ;
        }
        tr[u].l = l; tr[u].r = r;
        int mid = l + r >> 1;
        build(u * 2, l, mid);
        build(u * 2 + 1, mid + 1, r);
        pushup(tr[u], tr[u * 2], tr[u * 2 + 1]);
    }

    TreeNode query(int u, int l, int r)
    {
        if (tr[u].l >= l && tr[u].r <= r) return tr[u];
        int mid = tr[u].l + tr[u].r >> 1;
        if (r <= mid) return query(u * 2, l, r);
        else if (l > mid) return query(u * 2 + 1, l, r);
        else
        {
            TreeNode lt = query(u * 2, l, r);
            TreeNode rt = query(u * 2 + 1, l, r);
            TreeNode tmp;
            pushup(tmp, lt, rt);
            return tmp;
        }
    }

    void modify(int u, int x, char y)   //x是修改的下标,y要修改为的字符
    {
        if (tr[u].l == x && tr[u].r == x)
        {
            tr[u] = { x, x, 1, y, y, 1, 1, 1 };
            return ;
        }
        int mid = tr[u].l + tr[u].r >> 1;
        if (x <= mid) modify(u * 2, x, y);
        else  modify(u * 2 + 1, x, y);
        //else  if (x > mid) modify(u * 2 + 1, x, y);  上面的等价与这个，因为只有一种情况所以直接else
        pushup(tr[u], tr[u * 2], tr[u * 2 + 1]);
    }
public:
    vector<int> longestRepeating(string s, string queryCharacters, vector<int>& queryIndices) {
        this->s = s;
        int n=s.size();
        build(1, 1, n);
        vector<int> ans;
        for (int i = 0; i < queryCharacters.size(); ++ i)
        {
            modify(1, queryIndices[i] + 1, queryCharacters[i]);
            ans.push_back(query(1, 1, n).dmax);
        }
        return ans;
    }
};