#include "meetings.h"
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
// #define int long long
typedef long long ll ;
const ll ooo = 1e18 ;
const ll oo = 2e9 ;
const double PI = acos(-1) ;
const ll M = 1e9 + 7 ;
const int N = 10000010 ;
vector<ll> minimum_costs(vector<int> H, vector<int> L, vector<int> R) {
int Q = L.size();
vector<ll> C(Q);
for (int j = 0; j < Q; ++j) {
ll ans = ooo;
int l = L[j] , r = R[j];
stack<pair<ll,ll>> q;
ll cost = 0;
vector<ll> cl(H.size()) , cr(H.size());
for(int i = l ; i <= r ;++i){
ll w = 1 ;
while(q.size() && q.top().first <= H[i]){
cost += (ll)(H[i] - q.top().first) * q.top().second;
w += q.top().second;
q.pop();
}
q.push({H[i] , w});
cl[i] = cost;
cost += H[i];
}
q = stack<pair<ll,ll>>();
cost = 0;
for(int i = r ; i >= l ;--i){
ll w = 1 ;
while(q.size() && q.top().first <= H[i]){
cost += (ll)(H[i] - q.top().first) * q.top().second;
w += q.top().second;
q.pop();
}
// cout << i << ' ' << cost
q.push({H[i] , w});
cr[i] = cost;
cost += H[i];
}
for(int i = l ; i <= r ; ++i) ans = min(ans , cl[i] + cr[i] + H[i]);
C[j] = ans;
}
return C;
}
