<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 Info{
    char left='#';
    char right='#';
    int prefixCommon=0;
    int suffixCommon=0;
    int res=0;
};

class Solution {
private:
    Info tree[400001];
public:
    int MAX(int a, int b, int c, int d, int e){
        return max(max(max(a,b),max(c,d)),e);
    }
    
    Info merge(Info &left, Info &right, int low, int mid, int high, int parent){
        Info temp;
        
        temp.left=tree[2*parent+1].left;
        temp.right=tree[2*parent+2].right;
        temp.prefixCommon=tree[2*parent+1].prefixCommon;
        temp.suffixCommon=tree[2*parent+2].suffixCommon;
        temp.res=MAX(temp.res,temp.prefixCommon,temp.suffixCommon,tree[2*parent+1].res,tree[2*parent+2].res);
        
        if(tree[2*parent+1].left==tree[2*parent+2].left && tree[2*parent+1].prefixCommon==mid-low+1){
            temp.prefixCommon=tree[2*parent+1].prefixCommon+tree[2*parent+2].prefixCommon;
        }
        if(tree[2*parent+1].right==tree[2*parent+2].right && tree[2*parent+2].suffixCommon==high-(mid+1)+1){
            temp.suffixCommon=tree[2*parent+1].suffixCommon+tree[2*parent+2].suffixCommon;
        }
        if(tree[2*parent+1].right==tree[2*parent+2].left){
            temp.res=max(temp.res,tree[2*parent+1].suffixCommon+tree[2*parent+2].prefixCommon);
        }
        return temp;
    }
    
    void build(string &s, int low, int high, int parent){
        if(low>high){
            return;
        }
        if(low==high){
            Info res={s[low],s[low],1,1,1};
            tree[parent]=res;
            return;
        }
        int mid=(low+high)/2;
        build(s,low,mid,2*parent+1);
        build(s,mid+1,high,2*parent+2);
        tree[parent]=merge(tree[2*parent+1],tree[2*parent+2],low,mid,high,parent);
    }
    
    void update(int low, int high, int parent, int index, char val){
        if(low>high){
            return;
        }
        if(low==high){
            Info res={val,val,1,1,1};
            tree[parent]=res;
            return;
        }
        int mid=(low+high)/2;
        if(index<=mid){
            update(low,mid,2*parent+1,index,val);
        }
        else{
            update(mid+1,high,2*parent+2,index,val);
        }
        tree[parent]=merge(tree[2*parent+1],tree[2*parent+2],low,mid,high,parent);
    }
    
    vector<int> longestRepeating(string s, string queryCharacters, vector<int>& queryIndices) {
        int n=s.size();
        vector<int> res;
        build(s,0,n-1,0);
        for(int i=0;i<queryIndices.size();i++){
            update(0,n-1,0,queryIndices[i],queryCharacters[i]);
            res.push_back(tree[0].res);
        }
        return res;
    }
};
73100