class Solution {
public:
    int maxSubarraySumCircular(vector<int>& A) {
        int n=A.size();
        int currMax=A[0],currMin=A[0];
        int maxCase=A[0],minCase=A[0];
        int sum=A[0];
        for(int i=1;i<n;i++){
            sum+=A[i];
            currMax=max(currMax+A[i],A[i]);
            currMin=min(currMin+A[i],A[i]);
            maxCase=max(maxCase,currMax);
            minCase=min(minCase,currMin);
        }
        return maxCase<0?maxCase:max(maxCase,(sum-minCase));
    }
};