13.md

Count the number of incremovable subarrays 1

 bool check(vector<int>& nums,int i,int j)
    {
        int n = nums.size();
        int prev = INT_MIN;
        for (int k = 0; k < n; k++) {
             if ((i <= k) && (k <= j)) continue;
            if (prev >= nums[k]) return false;
            prev = nums[k];
        }
        return true;
    }
    int incremovableSubarrayCount(vector<int>& nums) {
        int ans=0,n=nums.size();

        for(int i=0;i<n;i++)
        {
            for(int j=i;j<n;j++)
            {
                if(check(nums,i,j))
                    ans++;
            }
        }

        return ans;
    }