1
class Solution:
2
    def sumOfBeauties(self, nums: List[int]) -> int:
3
        n = len(nums)
4
        max_dp = [0] * n
5
        min_dp = [float(inf)] * n
6
        max_dp[0] = nums[0]
7
        min_dp[-1] = nums[-1]
8

9
        for i in range(1, n):
10
            max_dp[i] = max(nums[i], max_dp[i - 1])
11

12
        for i in range(n - 2, -1, -1):
13
            min_dp[i] = min(nums[i], min_dp[i + 1])
14

15
        ans = 0
16
        for i in range(1, n - 1):
17
            if max_dp[i - 1] < max_dp[i] and nums[i] < min_dp[i + 1]:
18
                ans += 2
19
            elif nums[i - 1] < nums[i] < nums[i + 1]:
20
                ans += 1
21
        return ans