<p>You are given an array <code>prices</code> where <code>prices[i]</code> is the price of a given stock on the <code>i<sup>th</sup></code> day, and an integer <code>fee</code> representing a transaction fee.</p>

<p>Find the maximum profit you can achieve. You may complete as many transactions as you like, but you need to pay the transaction fee for each transaction.</p>

<p><strong>Note:</strong></p>

<ul>
	<li>You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).</li>
	<li>The transaction fee is only charged once for each stock purchase and sale.</li>
</ul>

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

<pre>
<strong>Input:</strong> prices = [1,3,2,8,4,9], fee = 2
<strong>Output:</strong> 8
<strong>Explanation:</strong> The maximum profit can be achieved by:
- Buying at prices[0] = 1
- Selling at prices[3] = 8
- Buying at prices[4] = 4
- Selling at prices[5] = 9
The total profit is ((8 - 1) - 2) + ((9 - 4) - 2) = 8.
</pre>

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

<pre>
<strong>Input:</strong> prices = [1,3,7,5,10,3], fee = 3
<strong>Output:</strong> 6
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= prices.length &lt;= 5 * 10<sup>4</sup></code></li>
	<li><code>1 &lt;= prices[i] &lt; 5 * 10<sup>4</sup></code></li>
	<li><code>0 &lt;= fee &lt; 5 * 10<sup>4</sup></code></li>
</ul>

class Solution {
public:
    int dp[500001][2];
    int solver(int idx , vector<int>&prices, int fee,int curr,int n){
        if(idx>=n){
            if(curr!=-1)return -1e9;
            return 0;
        }
        if(curr==-1){
            if(dp[idx][0]!=-1)return dp[idx][0];
        }
        else if(dp[idx][1]!=-1)return dp[idx][1];
        if(curr==-1){
            int take=solver(idx+1,prices,fee,prices[idx],n)-prices[idx];
            int notake=solver(idx+1,prices,fee,curr,n);
            return dp[idx][0]=max(take,notake);
        }
        else{
            int sale=prices[idx]-fee+solver(idx+1,prices,fee,-1,n);
            int nosale=solver(idx+1,prices,fee,curr,n);
            return dp[idx][1]=max(sale,nosale);
        }
        return -1;
    }
    int maxProfit(vector<int>& prices, int fee) {
        memset(dp,-1,sizeof(dp));
        int n=prices.size();
        return solver(0,prices,fee,-1,n);
        
    }
};
66496