<p>You are given a <strong>0-indexed</strong> string <code>s</code>. You are also given a <strong>0-indexed</strong> string <code>queryCharacters</code> of length <code>k</code> and a <strong>0-indexed</strong> array of integer <strong>indices</strong> <code>queryIndices</code> of length <code>k</code>, both of which are used to describe <code>k</code> queries.</p>

<p>The <code>i<sup>th</sup></code> query updates the character in <code>s</code> at index <code>queryIndices[i]</code> to the character <code>queryCharacters[i]</code>.</p>

<p>Return <em>an array</em> <code>lengths</code> <em>of length </em><code>k</code><em> where</em> <code>lengths[i]</code> <em>is the <strong>length</strong> of the <strong>longest substring</strong> of </em><code>s</code><em> consisting of <strong>only one repeating</strong> character <strong>after</strong> the</em> <code>i<sup>th</sup></code> <em>query</em><em> is performed.</em></p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;babacc&quot;, queryCharacters = &quot;bcb&quot;, queryIndices = [1,3,3]
<strong>Output:</strong> [3,3,4]
<strong>Explanation:</strong> 
- 1<sup>st</sup> query updates s = &quot;<u>b<strong>b</strong>b</u>acc&quot;. The longest substring consisting of one repeating character is &quot;bbb&quot; with length 3.
- 2<sup>nd</sup> query updates s = &quot;bbb<u><strong>c</strong>cc</u>&quot;. 
  The longest substring consisting of one repeating character can be &quot;bbb&quot; or &quot;ccc&quot; with length 3.
- 3<sup>rd</sup> query updates s = &quot;<u>bbb<strong>b</strong></u>cc&quot;. The longest substring consisting of one repeating character is &quot;bbbb&quot; with length 4.
Thus, we return [3,3,4].
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;abyzz&quot;, queryCharacters = &quot;aa&quot;, queryIndices = [2,1]
<strong>Output:</strong> [2,3]
<strong>Explanation:</strong>
- 1<sup>st</sup> query updates s = &quot;ab<strong>a</strong><u>zz</u>&quot;. The longest substring consisting of one repeating character is &quot;zz&quot; with length 2.
- 2<sup>nd</sup> query updates s = &quot;<u>a<strong>a</strong>a</u>zz&quot;. The longest substring consisting of one repeating character is &quot;aaa&quot; with length 3.
Thus, we return [2,3].
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 10<sup>5</sup></code></li>
	<li><code>s</code> consists of lowercase English letters.</li>
	<li><code>k == queryCharacters.length == queryIndices.length</code></li>
	<li><code>1 &lt;= k &lt;= 10<sup>5</sup></code></li>
	<li><code>queryCharacters</code> consists of lowercase English letters.</li>
	<li><code>0 &lt;= queryIndices[i] &lt; s.length</code></li>
</ul>

struct Node{
    pair<int,int>left,right;
    int mid;
};
class SegmentTree{
    vector<Node>tree;
    int n;
public:
    SegmentTree(string&s){
        n = s.size();
        tree.resize(4*n);
        build(1,0,n-1,s);
    }
    int ask(int l,int r){
        Node a = query(1,0,n-1,l,r);
        return max({a.mid,a.left.first,a.right.first});
    }
    void change(int ind,int val){
        update(1,0,n-1,ind,val);
    }
private:
    Node build(int node,int l,int r,string&s){
        if(l==r){ 
            tree[node].left.first =tree[node].right.first= 1;
            tree[node].left.second=tree[node].right.second = s[l];
            tree[node].mid = -1;
            return tree[node];
        }
        int mid = l+(r-l)/2;
        Node a = build(2*node,l,mid,s);
        Node b = build(2*node+1,mid+1,r,s);
        return tree[node] = merge(a,b);
    }
    Node query(int node,int l,int r,int ql,int qr){
        if(ql==l&&qr==r)return tree[node];
        if(ql>r||qr<l){
            Node empty;
            empty.left=empty.right={0,0};
            empty.mid = -1;
            return empty;
        }
        int mid = l+(r-l)/2;
        Node a = query(2*node,l,mid,ql,min(qr,mid));
        Node b = query(2*node+1,mid+1,r,max(ql,mid+1),qr);
        return merge(a,b);
    }
    Node update(int node,int l,int r,int ind,int val){
        if(l==ind&&r==ind){
            tree[node].left.first =tree[node].right.first= 1;
            tree[node].left.second=tree[node].right.second = val;
            tree[node].mid = -1;
            return tree[node];
        }
        if(l>ind||r<ind){
            return tree[node];
        }
        int mid = l+(r-l)/2;
        Node a = update(2*node,l,mid,ind,val);
        Node b = update(2*node+1,mid+1,r,ind,val);
        return tree[node] = merge(a,b);
    }
    Node merge(Node&a,Node&b){
        Node c;
        if(a.mid==-1&&b.mid==-1){
            if(a.right.second==b.left.second){
                c.left.first = c.right.first = a.right.first+b.left.first;
                c.left.second = c.right.second = a.right.second;
                c.mid = -1;
                return c;
            }
            c.left.first = a.left.first;
            c.left.second = a.left.second;
            c.right.first = b.right.first;
            c.right.second = b.right.second;
            c.mid = max(a.left.first,b.right.first);
            return c;
        }
        else if(a.mid!=-1&&b.mid!=-1){
            c.left = a.left;
            c.right = b.right;
            if(a.right.second==b.left.second){
                c.mid = max({a.right.first+b.left.first,a.mid,b.mid,a.left.first,b.right.first});
                return c;
            }
            c.mid = max({a.right.first,b.left.first,a.left.first,b.right.first,a.mid,b.mid});
            return c;
        }
        else if(a.mid==-1&&b.mid!=-1){
            if(a.right.second==b.left.second){
                c.left.first = a.left.first+b.left.first;
                c.left.second = a.left.second;
                c.right = b.right;
                c.mid = max({a.left.first+b.left.first,b.mid,b.right.first});
                return c;
            }
            c.left = a.left;
            c.right = b.right;
            c.mid = max({b.left.first,b.mid,a.left.first,b.right.first});
            return c;
        }
        else{
            if(a.right.second==b.left.second){
                c.left = a.left;
                c.right.first = a.right.first+b.left.first;
                c.right.second = a.right.second;
                c.mid = max({a.right.first+b.left.first,a.mid,a.left.first});
                return c;
            }
            c.left = a.left;
            c.right = b.right;
            c.mid = max({a.right.first,a.mid,a.left.first,b.right.first});
            return c;
        }
    }
};
class Solution {
public:
    vector<int> longestRepeating(string s, string queryCharacters, vector<int>& queryIndices) { 
        SegmentTree*seg = new SegmentTree(s);
        vector<int>ans;
        for(int i=0;i<queryIndices.size();i++){
            seg->change(queryIndices[i],queryCharacters[i]);
            ans.push_back(seg->ask(0,s.size()-1));
        }
        return ans;
    }
};
107400