#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
const int maxa = 100;
struct segtree
{
int tree_siz;
int* min_;
ll* oper;
void reset(int n)
{
tree_siz = (1<<(__lg(n)+2))-1;
min_ = new int[tree_siz+1];
oper = new ll[tree_siz+1];
rep(i,tree_siz+1)
{
min_[i] = 1e9;
oper[i] = 0;
}
}
void spych(int v)
{
min_[v*2+1] += oper[v];
min_[v*2] += oper[v];
oper[v*2+1] += oper[v];
oper[v*2] += oper[v];
oper[v] = 0;
}
void add_seg2(int akt, int p1, int p2, int s1, int s2, int x)
{
if(s2 < p1 || s1 > p2) return;
if(p1 >= s1 && p2 <= s2)
{
min_[akt] += x;
oper[akt] += x;
return;
}
spych(akt);
add_seg2(akt*2,p1,(p1+p2)/2,s1,s2,x);
add_seg2(akt*2+1,(p1+p2)/2+1,p2,s1,s2,x);
min_[akt] = min(min_[akt*2],min_[akt*2+1]);
}
int first_less2(int akt, int p1, int p2, int x)
{
if(p1 == p2) return p1;
spych(akt);
if(min_[akt*2+1] < x) return first_less2(akt*2+1,(p1+p2)/2+1,p2,x);
return first_less2(akt*2,p1,(p1+p2)/2,x);
}
void add_seg(int s1, int s2, int x)
{
if(s1 > s2) return;
add_seg2(1,0,tree_siz/2,s1,s2,x);
}
int first_less(int x)
{
return first_less2(1,0,tree_siz/2,x);
}
};
int A[200001];
int L_sum[200001][101];
int R_sum[200001][101];
int sum_beg[200001][101];
int A_cnt[200001][101];
vi st[101];
segtree trees[101];
vector<pii> queries[200001];
int poz[200001][101];
int query_ans[200001];
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random_start();
int n;
cin >> n;
rep2(i,1,n) cin >> A[i];
rep2(a,1,maxa)
{
int sum_L = 0;
int sum_R = 0;
int sum2 = 0;
int cnt = 0;
rep2(i,1,n)
{
if(A[i] > a)
{
sum_R += A[i];
sum2 += -A[i];
}
else if(A[i] == a)
{
sum_L += 2*A[i];
sum_R += -A[i];
sum2 += -A[i];
cnt++;
poz[cnt][a] = i;
}
else
{
sum_R += -A[i];
sum2 += A[i];
}
A_cnt[i][a] = cnt;
L_sum[i][a] = sum_L-2*A[i];
R_sum[i][a] = sum_R;
sum_beg[i][a] = sum2;
}
}
rep2(i,1,maxa) trees[i].reset(A_cnt[n][i]+1);
rep2(i,1,n) trees[A[i]].add_seg(A_cnt[i][A[i]],A_cnt[i][A[i]],L_sum[i][A[i]]);
rep2(i,1,maxa) st[i] = {0};
int q;
cin >> q;
rep(qq,q)
{
int l,r;
cin >> l >> r;
queries[r].pb({l,qq});
}
rep2(i,1,n)
{
rep2(a,1,maxa)
{
while(siz(st[a]) > 1 && R_sum[st[a].back()][a] > R_sum[i][a])
{
int l = st[a][siz(st[a])-2]+1;
int r = A_cnt[st[a].back()][a];
if(A[l] != a) l = A_cnt[l][a]+1;
else l = A_cnt[l][a];
trees[a].add_seg(l,r,-R_sum[st[a].back()][a]+R_sum[i][a]);
st[a].pop_back();
}
st[a].pb(i);
if(A[i] == a) trees[a].add_seg(A_cnt[i][a],A_cnt[i][a],-1e9+R_sum[i][a]);
}
forall(it,queries[i])
{
int ans = 0;
int pop_bad = it.ff-1;
int const_add = 0;
rep2(a,1,maxa)
{
int first_bad = max(pop_bad,poz[trees[a].first_less(-sum_beg[it.ff-1][a]-const_add)][a]);
if(first_bad >= it.ff) const_add += 2*(A_cnt[first_bad][a]-A_cnt[it.ff-1][a])*a;
ans += A_cnt[i][a]-A_cnt[first_bad][a];
pop_bad = first_bad;
}
query_ans[it.ss] = ans;
}
}
rep(qq,q) cout << query_ans[qq] << "\n";
}
