795

class Solution {
public:
    int numSubarrayBoundedMax(vector<int>& nums, int left, int right) {
        return atMostK(right, nums)-atMostK(left-1, nums);
    }
    int atMostK(int k, vector<int> & nums){
        int ans = 0, cur=0;
        for(int x: nums){
            cur = (x<=k) ? cur+1: 0;
            ans += cur;
        }
        return ans;
    }
};