<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>

class sgtree{
    public:
    vector<int>nums,left,right;
    vector<char>lc,rc;
    int n;
    sgtree(string& s){
        n=s.size();
        nums.resize(4*n+5,0);
        left.resize(4*n+5,-1);
        right.resize(4*n+5,-1);
        lc.resize(4*n+5,'*');
        rc.resize(4*n+5,'*');
        build(0,0,n-1,s);
    }
    void build(int ind,int low,int high,string& s){
        if(low>high) return ;
        if(low==high){
            left[ind]=low,right[ind]=low;
            lc[ind]=rc[ind]=s[low];
            nums[ind]=1;
            return ;
        }
        int mid=low+(high-low)/2;
        build(2*ind+1,low,mid,s);
        build(2*ind+2,mid+1,high,s);
        merge(ind,low,mid,high);
    }
    void merge(int ind,int l,int m,int h){
        int lt=2*ind+1,rt=2*ind+2,maxi=0;
        left[ind]=left[lt];
        right[ind]=right[rt];
        lc[ind]=lc[lt]; rc[ind]= rc[rt];

        if(rc[lt]==lc[rt]){
            if(left[lt]==m) left[ind]=left[rt];
            if(right[rt]==m+1) right[ind]=right[lt];
            maxi=left[rt]-right[lt]+1;
        }
        maxi=max(maxi,left[ind]-l+1);
        maxi=max(maxi,h-right[ind]+1);
        maxi=max(maxi,max(nums[lt],nums[rt]));
        nums[ind]=maxi;
    }
    int update(int ind,int l,int h,char ch,int pos){
        if(l>h) return 0;
        if(l==h){
            left[ind]=right[ind]=l;
            nums[ind]=1;
            lc[ind]=rc[ind]=ch;
            return 1;
        }
        int mid=(l+h)/2;
        if(mid>=pos and pos>=l){
            update(2*ind+1,l,mid,ch,pos);
        }
        else update(2*ind+2,mid+1,h,ch,pos);
        merge(ind,l,mid,h);
        return nums[ind];
    }
};

class Solution {
public:
    
    vector<int> longestRepeating(string s, string qchar, vector<int>& qind) {
       sgtree node(s);
        vector<int>ans;
        for(int i=0;i<qind.size();i++){
             ans.push_back(node.update(0,0,s.size()-1,qchar[i],qind[i]));
        }
        return ans;
       
    }
};
97000