LeetCode 2865. 美丽塔 I
原题链接
简单
作者:
代码人生
,
2024-02-20 12:10:45
,
所有人可见
,
阅读 42
class Solution {
public:
long long maximumSumOfHeights(vector<int>& maxHeights) {
long long ans = 0;
for(int i=0;i<maxHeights.size();i++){
long long sum = maxHeights[i];
int num = maxHeights[i];
for(int j=i-1;j>=0;j--){
sum += min(maxHeights[j],num);
num = min(maxHeights[j],num);
}
num = maxHeights[i];
for(int j=i+1;j<maxHeights.size();j++){
sum += min(maxHeights[j],num);
num = min(maxHeights[j],num);
}
ans = max(ans,sum);
}
return ans;
}
};