<p>You are given a string <code>s</code> and two integers <code>x</code> and <code>y</code>. You can perform two types of operations any number of times.</p>

<ul>
	<li>Remove substring <code>&quot;ab&quot;</code> and gain <code>x</code> points.

	<ul>
		<li>For example, when removing <code>&quot;ab&quot;</code> from <code>&quot;c<u>ab</u>xbae&quot;</code> it becomes <code>&quot;cxbae&quot;</code>.</li>
	</ul>
	</li>
	<li>Remove substring <code>&quot;ba&quot;</code> and gain <code>y</code> points.
	<ul>
		<li>For example, when removing <code>&quot;ba&quot;</code> from <code>&quot;cabx<u>ba</u>e&quot;</code> it becomes <code>&quot;cabxe&quot;</code>.</li>
	</ul>
	</li>
</ul>

<p>Return <em>the maximum points you can gain after applying the above operations on</em> <code>s</code>.</p>

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

<pre>
<strong>Input:</strong> s = &quot;cdbcbbaaabab&quot;, x = 4, y = 5
<strong>Output:</strong> 19
<strong>Explanation:</strong>
- Remove the &quot;ba&quot; underlined in &quot;cdbcbbaaa<u>ba</u>b&quot;. Now, s = &quot;cdbcbbaaab&quot; and 5 points are added to the score.
- Remove the &quot;ab&quot; underlined in &quot;cdbcbbaa<u>ab</u>&quot;. Now, s = &quot;cdbcbbaa&quot; and 4 points are added to the score.
- Remove the &quot;ba&quot; underlined in &quot;cdbcb<u>ba</u>a&quot;. Now, s = &quot;cdbcba&quot; and 5 points are added to the score.
- Remove the &quot;ba&quot; underlined in &quot;cdbc<u>ba</u>&quot;. Now, s = &quot;cdbc&quot; and 5 points are added to the score.
Total score = 5 + 4 + 5 + 5 = 19.</pre>

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

<pre>
<strong>Input:</strong> s = &quot;aabbaaxybbaabb&quot;, x = 5, y = 4
<strong>Output:</strong> 20
</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>1 &lt;= x, y &lt;= 10<sup>4</sup></code></li>
	<li><code>s</code> consists of lowercase English letters.</li>
</ul>

class Solution:
    def calc_substr(self, s, x, y) -> int:
        # (()))()(
        if x >= y:
            c1, c2 = "a", "b"
        else:
            c1, c2 = "b", "a"
        max_reward = max(x,y)
        min_reward = min(x,y)
        stack1 = []
        res = 0
        bad_c2_count = 0
        for i, char in enumerate(s):
            if char == c1:
                stack1.append(char)
            else:
                if not stack1 or stack1[-1] != c1:
                    stack1.append(char)
                    bad_c2_count += 1
                else:
                    stack1.pop()
                    res += max_reward
        #print(stack1, res)
        res += min(bad_c2_count, len(stack1) - bad_c2_count) * min_reward

        return res

    def maximumGain(self, s: str, x: int, y: int) -> int:
        start, end = -1, -1
        ab_check = [0,0]
        res = 0
        s += '.'
        for i, char in enumerate(s):
            if char in 'ab':
                if start == -1:
                    start = i
                end = i
                if char == 'a':
                    ab_check[0] = 1
                if char == 'b':
                    ab_check[1] = 1
            else:
                if start != -1:
                    if sum(ab_check) == 2:
                        res += self.calc_substr(s[start:end+1], x, y)
                    start = -1
                    ab_check = [0,0]
        return res

            
        
458