1
class Solution {
2
 public:
3
  int sumOfBeauties(vector<int> &nums) {
4
    int n = nums.size();
5
    vector<int> right;
6
    vector<int> left;
7
    int low = nums[0];
8
    for (int i = 0; i < nums.size(); i++) {
9
      left.push_back(low);
10
      low = max(low, nums[i]);
11
    }
12
    low = nums[n - 1];
13
    for (int i = n - 1; i >= 0; i--) {
14
      right.push_back(low);
15
      low = min(low, nums[i]);
16
    }
17
    reverse(right.begin(), right.end());
18
    int ans = 0;
19
    for (int i = 1; i < n - 1; i++) {
20
      if (nums[i] > left[i] && nums[i] < right[i]) {
21
        ans += 2;
22
      } else if (nums[i] > nums[i - 1] && nums[i] < nums[i + 1]) {
23
        ans += 1;
24
      } else {
25
        ans += 0;
26
      }
27
    }
28
    return ans;
29
  }
30
};