1793

class Solution {
public:
    int maximumScore(vector<int>& nums, int k) {
        int ans, left, right, sz, mini;
        left = right = k;
        sz = nums.size();
        ans = nums[k];

        mini = nums[k];
        while(left > 0 || right < sz-1){
            if(left == 0)
                right++;
            else if(right == sz-1)
                left--;
            else if(nums[left-1] < nums[right+1])
                right++;
            else
                left--;
            mini = min(mini, min(nums[right], nums[left]));
            ans = max(ans, mini*(right-left+1));
        }
        return ans;
    }
};