#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "meetings.h"
VL minimum_costs(VI H, VI L, VI R) {
int n = H.size();
VVL prefs(n, VL(n+1));
replr(x, 0, n-1) {
replr(i, 1, n) prefs[x][i] = H[i-1];
replr(i, (x+1)+1, n) setmax(prefs[x][i], prefs[x][i-1]);
reprl(i, (x+1)-1, 1) setmax(prefs[x][i], prefs[x][i+1]);
/*replr(i, 1, n) cout << prefs[x][i] << " ";*/
/*cout << endl;*/
replr(i, 1, n) prefs[x][i] += prefs[x][i-1];
}
int q = L.size();
VL answ(q, 1e18);
rep(i, q) {
int l = L[i], r = R[i];
replr(x, l, r) {
setmin(answ[i], prefs[x][r+1]-prefs[x][l]);
}
}
return answ;
}
