题解 | 灌注水箱

#include<bits/stdc++.h>
using namespace std;
#define int long long 
const int N=2e5+10,INF=0x3f3f3f3f;

int n;
int h[N],tim[N];

void solve(){
	
	h[0]=INF;
	tim[0]=0;
	stack<int> st;
	st.push(0);
	
	for(int i=1;i<=n;i++){
		cin>>h[i];
		if(h[i]<=h[i-1]){
			tim[i]=tim[i-1]+h[i];
		}else{
			while(h[st.top()]<h[i]){
				st.pop();
			}
			int height=min(h[i],h[st.top()]);
			int width=i-st.top();
			tim[i]=tim[st.top()]+height*width;
		}
		st.push(i);
		cout<<tim[i]+1<<" ";
	}
	
	
	return;
}

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	cin>>n;
	
	solve();
    return 0;
}