Maximize the maximum subarray sum after removing atmost one element

#include <iostream>
using namespace std;

int maximizeSum(int arr[], int n) {
    
        // Max sum ending here with  
        // at most one deletion
        int maxEHereDel = arr[0];  
        
        // Max sum ending here 
        // without any deletion
        int mEhere = arr[0];  
        
        // To store result
        int res = arr[0]; 
        
        for (int i=1; i<n; i++) {
        
            int x = arr[i];
            
            // a) Start a new subarray
            // b) Exclude current element
            // c) Include current element
            maxEHereDel = max(x, max(mEhere, 
                            maxEHereDel+x));  
        
            // Updating maxEHere (without any deletion)
            // a) Begin a new subarray
            // b) Continue with the prev one
            mEhere = max(x, mEhere + x); 
            
            res = max(res, maxEHereDel);  
        }
        return res;
}

// Driver code
int main()
{
	int a[] = { 10, -100, -1, 10, -5, 4 };
	int n = sizeof(a) / sizeof(a[0]);
	cout << maximizeSum(a, n);
	return 0;
}