class Solution {
public:
    int sumOfBeauties(vector<int>& nums) {
        int n = nums.size();
        vector<int> minidx(n);
        vector<int> maxidx;
        int tmpmin = 1e5 + 1;
        int tmpmax = -1;
        int ans = 0;
        for (int i = nums.size() - 1; i >=1; i--) {
            if (nums[i] < tmpmin) {
                tmpmin = nums[i];
            }
            minidx[i] = tmpmin;
        }
        maxidx.push_back(nums[0]);
        tmpmax=nums[0];
        for (int i = 1; i <= nums.size() - 2; i++) {
            if (nums[i] > tmpmax) {
                tmpmax = nums[i];
            }
            maxidx.push_back(tmpmax);
            if (nums[i] < minidx[i+1] && nums[i] > maxidx[i-1]) {
                ans += 2;
            }
            else if (nums[i] > nums[i - 1] && nums[i] < nums[i + 1]) {
                ans += 1;
            }
        }
        return ans;
    }
};