leetcode

0 class Solution {

1 public:

2 int maximumScore(const vector<int> &nums, int k) {

3 const int n = nums.size();

4 int left = k - 1, right = k + 1, res = nums[k], mini = nums[k];

5 while (left >= 0 || right < n) {

6 const int a = left >= 0 ? nums[left] : 0;

7 const int b = right < n ? nums[right] : 0;

8 mini = min(mini, a < b ? nums[right++] : nums[left--]);

9 res = max(res, mini * (right - left - 1));

10 }

11 return res;

12 }

13 };