单调栈还没学,用暴力写了一发爆内存了
记录一下下次微调一下
class Solution {
public:
long long maximumSumOfHeights(vector<int>& maxHeights) {
int n=maxHeights.size();
long long sum,maxd=0;
int m,t=0;
while(t++<n){
sum=0;
m=t-1;
vector<int>heights(n,1);
heights[m]=maxHeights[m];
if(m>0)
for(int i=m-1;i>=0;i--){
heights[i]=min(maxHeights[i],heights[i+1]);
}
if(m<n-1)
for(int i=m+1;i<n;i++){
heights[i]=min(maxHeights[i],heights[i-1]);
}
for(long long t:heights)
sum+=t;
heights.clear();
heights.shrink_to_fit();
maxd=max(sum,maxd);
}
return maxd;
}
};