1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
#include <bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define pb push_back
#define SZ(a) ((int) a.size())
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (int i = (a); i >= (b); --i)
#define debug(var) cerr << #var <<":"<<var<<"\n";
#define lson(var) (var<<1)
#define rson(var) ((var<<1)+1)
using namespace std;
using ll = long long;using ull = unsigned long long;
using DB=double;using LD=long double;
using i128 = __int128;using pdd = pair<DB,DB>;using plb = pair<ll,bool>;
using pll = pair<ll,ll>;
using arr3 = array<ll,3> ;using arr2 = array<ll,2>;
constexpr ll MAXN=static_cast<ll>(1e6)+10,INF=static_cast<ll>(1e17)+9;
constexpr ll mod=static_cast<ll>(1e9)+7;
constexpr double eps=1e-8;
ll N,M,Q,X,K,lT,A[MAXN],L[MAXN],R[MAXN];
inline void init(){
}
struct BIT {
vector<ll> tr;
int n;
inline int lowbit(int x) { return x & (-x); }
BIT(int ln) {
n = ln;
tr.resize(n+5,0);
}
inline void add(int p, int x) {
if(p==0) return;
while (p <= n) {
tr[p] += x;
p += lowbit(p);
}
}
inline ll query(int l, int r) {
ll lres = 0, rres = 0;
l -= 1;
while (l > 0) {
lres += tr[l];
l -= lowbit(l);
}
while (r > 0) {
rres += tr[r];
r -= lowbit(r);
}
return rres - lres;
}
inline int findKth(int k) {
int cx = 0;
for (int i = 1 << 20; i > 0; i >>= 1) {
if (cx + i <= n && lowbit(cx + i) - tr[cx + i] < k) {
k -= lowbit(cx + i) - tr[cx + i];
cx += i;
}
}
return cx + 1;
}
};
inline void solve(){
cin>>N>>Q;
init();
FOR(i,1,N){
cin>>A[i];
}
BIT trp(N),ansp(N),trs(N),anss(N);
ll ans=0;
FOR(i,1,N){
ll res=trp.query(A[i],N);
ansp.add(A[i],res);
ans+=res;
trp.add(A[i],1);
}
ROF(i,N,1){
ll res=trs.query(1,A[i]);
anss.add(A[i],res);
trs.add(A[i],1);
}
FOR(i,1,Q){
cin>>L[i]>>R[i];
if(L[i]==R[i]){
cout<<0<<"\n";
continue;
}
ll lans=ans;
lans-=ansp.query(R[i],N);
lans-=anss.query(1,L[i]);
if(lans<0) cout<<"0\n";
else cout<<lans<<"\n";
#ifdef LOCAL
debug(lans);
#endif
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>lT;
while(lT--){
solve();
}
return 0;
}
|