<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 SegmentTreeNode:
    def __init__(self):
        self.left = None
        self.right = None
        self.length = 1
        self.max_length = 1
        self.left_length = 1
        self.right_length = 1

class Solution:
    def longestRepeating(self, s: str, queryCharacters: str, queryIndices: List[int]) -> List[int]:
        n = len(s)
        segments = [SegmentTreeNode() for _ in range(4 * n)]

        def build(node, left, right):
            if left == right:
                segments[node].length = 1
                segments[node].max_length = 1
                segments[node].left_length = 1
                segments[node].right_length = 1
                return
            mid = (left + right) // 2
            segments[node].left = 2 * node + 1
            segments[node].right = 2 * node + 2
            build(segments[node].left, left, mid)
            build(segments[node].right, mid + 1, right)
            segments[node].length = segments[segments[node].left].length + segments[segments[node].right].length
            segments[node].max_length = max(segments[segments[node].left].max_length, segments[segments[node].right].max_length)
            if s[mid] == s[mid + 1]:
                segments[node].max_length = max(segments[node].max_length, segments[segments[node].left].right_length + segments[segments[node].right].left_length)
                segments[node].left_length = segments[segments[node].left].left_length
                if segments[segments[node].left].left_length == mid - left + 1:
                    segments[node].left_length += segments[segments[node].right].left_length
                segments[node].right_length = segments[segments[node].right].right_length
                if segments[segments[node].right].right_length == right - mid:
                    segments[node].right_length += segments[segments[node].left].right_length
            else:
                segments[node].left_length = segments[segments[node].left].left_length
                segments[node].right_length = segments[segments[node].right].right_length

        def update(node, left, right, pos, val):
            if left == right:
                return
            mid = (left + right) // 2
            if pos <= mid:
                update(segments[node].left, left, mid, pos, val)
            else:
                update(segments[node].right, mid + 1, right, pos, val)
            segments[node].length = segments[segments[node].left].length + segments[segments[node].right].length
            segments[node].max_length = max(segments[segments[node].left].max_length, segments[segments[node].right].max_length)
            if s[mid] == s[mid + 1]:
                segments[node].max_length = max(segments[node].max_length, segments[segments[node].left].right_length + segments[segments[node].right].left_length)
                segments[node].left_length = segments[segments[node].left].left_length
                if segments[segments[node].left].left_length == mid - left + 1:
                    segments[node].left_length += segments[segments[node].right].left_length
                segments[node].right_length = segments[segments[node].right].right_length
                if segments[segments[node].right].right_length == right - mid:
                    segments[node].right_length += segments[segments[node].left].right_length
            else:
                segments[node].left_length = segments[segments[node].left].left_length
                segments[node].right_length = segments[segments[node].right].right_length

        build(0, 0, n - 1)
        result = []
        for i in range(len(queryCharacters)):
            if s[queryIndices[i]] != queryCharacters[i]:
                s = s[:queryIndices[i]] + queryCharacters[i] + s[queryIndices[i] + 1:]
                update(0, 0, n - 1, queryIndices[i], queryCharacters[i])
            result.append(segments[0].max_length)
        return result
106600