<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 Solution {
public:
    vector<int> longestRepeating(string s, string queryCharacters, vector<int>& queryIndices) {
        multiset<int> st;
        map<int,pair<char,int>> mp;
        int last=0;
        int streak=0;
        int n=s.length();
        for(int i=0;i<n;i++){
            if(s[i]==s[last]){
                streak++;
            }
            else{
                if(streak){
                    cout<<last<<" "<<s[last]<<" "<<streak<<endl;
                    mp[last]={s[last],streak};
                    st.insert(streak);
                }
                 last=i;
                 streak=1;   
            }
        }

        if(streak){
              mp[last]={s[last],streak};
                    st.insert(streak);
        }

        int q=queryIndices.size();
        vector<int> ans;
        for(int i=0;i<q;i++){
            char c=queryCharacters[i];
            int ind=queryIndices[i];
            // cout<<ind<<endl;
            auto it=mp.upper_bound(ind);
            // cout<<(*it).first<<endl;
            it--;
            if((*it).second.first==c){
                auto f=st.end();
                f--;
                ans.push_back(*f);
            }
            else{
                if(i==0){
                    // cout<<n<<" "<<(*it).first<<" "<<(*it).second.first<<endl;
                    // break;
                }
                  int key=(*it).first;
                  char val=(*it).second.first;
                  int streak=(*it).second.second;
                //   cout<<key<<" "<<val<<" "<<streak<<endl;
                //   for(auto it:st)cout<<it<<" ";
                //   cout<<endl;
                //   cout<<"ffff"<<endl;
                //    for(auto it:mp){
                //         cout<<it.first<<" "<<it.second.first<<endl;
                //     }
                //   cout<<"ffff"<<endl;

                  st.erase(st.find(streak));
                  mp.erase(key);
                  int left=ind-key;
                  if(left){st.insert(left);
                  mp[key]={val,left};
                  }
                  
                  int right=key+streak-1-ind;
                  if(right){st.insert(right);
                  mp[ind+1]={val,right};
                  }
                  
                  st.insert(1);
                  mp[ind]={c,1};

                   it=mp.lower_bound(ind);
                   if(ind!=0){
                      it--;
                      if((*it).second.first==mp[ind].first){
                         st.erase(st.find(mp[ind].second));
                        st.erase(st.find((*it).second.second));
                        st.insert((*it).second.second+mp[ind].second);
                        mp[(*it).first]={mp[ind].first,(*it).second.second+mp[ind].second};
                        
                        mp.erase(ind);
                        ind=(*it).first;
                       
                      }
                   }
                   it=mp.upper_bound(ind);
               
                   if(it!=mp.end()){
                     if((*it).second.first==mp[ind].first){
// cout<<"Asdf"<<endl;
     st.erase(st.find(mp[ind].second));
                        st.erase(st.find((*it).second.second));
                        st.insert((*it).second.second+mp[ind].second);

                        mp[ind]={mp[ind].first,(*it).second.second+mp[ind].second};
                     
                        mp.erase((*it).first);
                      
                      }
                   }
 auto f=st.end();
                f--;
                ans.push_back(*f);
            }

        }

        return ans;
    }
};
211900