#include <bits/stdc++.h>
#define ii pair<long long, long long>
using namespace std;
long long t[750001 << 2];
vector<int> H;
int last = 0, N;
vector<ii> Q[750001];
vector<long long> fwt(200001, LLONG_MAX);
void ins_f(int v, long long a){
for(; v > 0; v -= (v & -v)) fwt[v] = min(fwt[v], a);
}
long long query_f(int v){
long long ret = LLONG_MAX;
for(; v <= N; v += (v & -v)) ret = min(ret, fwt[v]);
return ret;
}
long long query(int v, int tl, int tr, int l, int r){
if(l > r) return -1;
if(tl == l && tr == r) return t[v];
int tm = (tl + tr) >> 1;
return max(query(v * 2, tl, tm, l, min(r, tm)), query(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r));
}
void ins(int v, int tl, int tr, int pos, int val){
if(tl == pos && tr == pos){
t[v] = val;
return;
}
int tm = (tl + tr) >> 1;
if(pos <= tm) ins(v * 2, tl, tm, pos, val);
else ins(v * 2 + 1, tm + 1, tr, pos, val);
t[v] = max(t[v * 2], t[v * 2 + 1]);
}
vector<long long> minimum_costs(vector<int> H_tmp, vector<int> L, vector<int> R){
H = H_tmp; N = H.size();
for(int i = 0; i < L.size(); i++) Q[R[i]].push_back({L[i], i});
vector<long long> ans(200001);
for(int i = 0; i < N; i++){
if(H[i] == 2){
ins(1, 0, N, last + 1, i - last);
last = i + 1; ins_f(i + 1, (i + 1) * 1ll);
}
for(auto x : Q[i]){
long long val = query(1, 0, N, x.first + 1, i + 1);
if(x.first == i){
ans[x.second] = H[i]; continue;
}
if(x.first + 1 > last){
val = max(val, i - x.first - 1 + (H[i] == 2 ? 0 : 1ll) + (H[x.first] == 2 ? 0 : 1ll));
}
else{
val = max(val, i - last + (H[i] == 2 ? 0 : 1ll));
}
long long qq = query_f(x.first + 1);
if(qq != LLONG_MAX) val = max(val, qq - (x.first + 1) - 1 + (H[x.first] == 2 ? 0 : 1ll));
// printf(">> %d %lld\n", i - x.first + 1, val);
ans[x.second] = ((i - x.first + 1 - val) * 2ll) + (val * 1ll);
}
}
ans.resize(L.size());
return ans;
}
