#include<bits/stdc++.h>
#define ll long long
using namespace std ;
ll h[3005];
ll st[3005*4+1];
void build (ll p , ll l, ll r)
{
if(l==r)
{
st[p]=h[l];
return ;
}
build(2*p,l,(l+r)/2);
build(2*p+1,(l+r)/2 + 1, r);
st[p]=max(st[p*2],st[2*p+1]);
}
ll query(ll p ,ll i , ll j , ll l ,ll r)
{
if(r < i || j < l)
{
return 0;
}
if(l <= i && j <= r)
{
return st[p];
}
ll mid = (i + j) / 2;
ll p1 = query(2*p, i, mid, l, r);
ll p2 = query(2*p+1, mid+1, j, l, r);
return max(p1,p2);
}
vector<ll> minimum_costs(vector<int> H, vector<int>L, vector<int>R)
{
vector<ll>c;
for(int i=0;i<H.size();i++)
{
h[i+1]=H[i];
}
build(1,1,H.size());
for(int i=0;i<L.size();i++)
{
c.push_back(query(1,L[i]+1,R[i]+1,1,H.size()));
}
return c;
}
